./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-ext/11_fmaxsymopt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d 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/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-ext/11_fmaxsymopt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 963498115a8eca6e92c68ab7fa8168826446f05b9b398350c3ee0745adf1bb45 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 19:50:53,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 19:50:53,148 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 19:50:53,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 19:50:53,183 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 19:50:53,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 19:50:53,187 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 19:50:53,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 19:50:53,192 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 19:50:53,196 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 19:50:53,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 19:50:53,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 19:50:53,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 19:50:53,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 19:50:53,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 19:50:53,201 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 19:50:53,201 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 19:50:53,202 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 19:50:53,203 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 19:50:53,205 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 19:50:53,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 19:50:53,213 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 19:50:53,214 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 19:50:53,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 19:50:53,226 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 19:50:53,226 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 19:50:53,227 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 19:50:53,227 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 19:50:53,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 19:50:53,230 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 19:50:53,230 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 19:50:53,231 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 19:50:53,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 19:50:53,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 19:50:53,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 19:50:53,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 19:50:53,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 19:50:53,236 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 19:50:53,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 19:50:53,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 19:50:53,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 19:50:53,238 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 19:50:53,263 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 19:50:53,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 19:50:53,265 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 19:50:53,265 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 19:50:53,266 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 19:50:53,266 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 19:50:53,267 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 19:50:53,267 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 19:50:53,267 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 19:50:53,268 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 19:50:53,268 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 19:50:53,269 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 19:50:53,269 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 19:50:53,269 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 19:50:53,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 19:50:53,269 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 19:50:53,270 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 19:50:53,270 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 19:50:53,270 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 19:50:53,270 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 19:50:53,270 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 19:50:53,271 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 19:50:53,271 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 19:50:53,271 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 19:50:53,271 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 19:50:53,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 19:50:53,272 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 19:50:53,272 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 19:50:53,272 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 19:50:53,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 19:50:53,272 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 19:50:53,273 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 19:50:53,273 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 19:50:53,273 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 19:50:53,273 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 963498115a8eca6e92c68ab7fa8168826446f05b9b398350c3ee0745adf1bb45 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 19:50:53,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 19:50:53,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 19:50:53,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 19:50:53,614 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 19:50:53,615 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 19:50:53,616 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/11_fmaxsymopt.i [2023-08-29 19:50:54,811 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 19:50:55,080 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 19:50:55,081 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/11_fmaxsymopt.i [2023-08-29 19:50:55,089 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d612c259e/1f7811d718754cdd806181b9f7d863af/FLAG829131807 [2023-08-29 19:50:55,099 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d612c259e/1f7811d718754cdd806181b9f7d863af [2023-08-29 19:50:55,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 19:50:55,102 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 19:50:55,104 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 19:50:55,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 19:50:55,108 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 19:50:55,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 07:50:55" (1/1) ... [2023-08-29 19:50:55,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2815d634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:50:55, skipping insertion in model container [2023-08-29 19:50:55,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 07:50:55" (1/1) ... [2023-08-29 19:50:55,117 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 19:50:55,160 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 19:50:55,507 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/11_fmaxsymopt.i[30540,30553] [2023-08-29 19:50:55,516 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 19:50:55,527 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 19:50:55,572 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/11_fmaxsymopt.i[30540,30553] [2023-08-29 19:50:55,578 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 19:50:55,630 INFO L208 MainTranslator]: Completed translation [2023-08-29 19:50:55,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:50:55 WrapperNode [2023-08-29 19:50:55,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 19:50:55,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 19:50:55,632 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 19:50:55,632 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 19:50:55,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:50:55" (1/1) ... [2023-08-29 19:50:55,663 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:50:55" (1/1) ... [2023-08-29 19:50:55,690 INFO L138 Inliner]: procedures = 171, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 83 [2023-08-29 19:50:55,691 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 19:50:55,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 19:50:55,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 19:50:55,692 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 19:50:55,700 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:50:55" (1/1) ... [2023-08-29 19:50:55,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:50:55" (1/1) ... [2023-08-29 19:50:55,705 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:50:55" (1/1) ... [2023-08-29 19:50:55,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:50:55" (1/1) ... [2023-08-29 19:50:55,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:50:55" (1/1) ... [2023-08-29 19:50:55,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:50:55" (1/1) ... [2023-08-29 19:50:55,726 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:50:55" (1/1) ... [2023-08-29 19:50:55,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:50:55" (1/1) ... [2023-08-29 19:50:55,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 19:50:55,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 19:50:55,734 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 19:50:55,734 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 19:50:55,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:50:55" (1/1) ... [2023-08-29 19:50:55,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 19:50:55,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:50:55,765 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) [2023-08-29 19:50:55,774 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 [2023-08-29 19:50:55,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 19:50:55,799 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-29 19:50:55,799 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-29 19:50:55,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 19:50:55,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 19:50:55,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 19:50:55,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 19:50:55,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 19:50:55,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 19:50:55,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 19:50:55,801 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 19:50:55,912 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 19:50:55,914 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 19:50:56,146 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 19:50:56,179 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 19:50:56,179 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-29 19:50:56,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:50:56 BoogieIcfgContainer [2023-08-29 19:50:56,181 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 19:50:56,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 19:50:56,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 19:50:56,186 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 19:50:56,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 07:50:55" (1/3) ... [2023-08-29 19:50:56,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d8a16e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 07:50:56, skipping insertion in model container [2023-08-29 19:50:56,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:50:55" (2/3) ... [2023-08-29 19:50:56,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d8a16e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 07:50:56, skipping insertion in model container [2023-08-29 19:50:56,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:50:56" (3/3) ... [2023-08-29 19:50:56,188 INFO L112 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2023-08-29 19:50:56,210 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 19:50:56,211 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-29 19:50:56,211 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 19:50:56,264 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 19:50:56,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 86 transitions, 177 flow [2023-08-29 19:50:56,329 INFO L130 PetriNetUnfolder]: 9/101 cut-off events. [2023-08-29 19:50:56,329 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:50:56,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 101 events. 9/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 137 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 63. Up to 4 conditions per place. [2023-08-29 19:50:56,335 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 86 transitions, 177 flow [2023-08-29 19:50:56,338 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 86 transitions, 177 flow [2023-08-29 19:50:56,341 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 19:50:56,348 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 86 transitions, 177 flow [2023-08-29 19:50:56,350 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 86 transitions, 177 flow [2023-08-29 19:50:56,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 86 transitions, 177 flow [2023-08-29 19:50:56,372 INFO L130 PetriNetUnfolder]: 9/101 cut-off events. [2023-08-29 19:50:56,373 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:50:56,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 101 events. 9/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 137 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 63. Up to 4 conditions per place. [2023-08-29 19:50:56,375 INFO L119 LiptonReduction]: Number of co-enabled transitions 1656 [2023-08-29 19:50:59,207 INFO L134 LiptonReduction]: Checked pairs total: 1674 [2023-08-29 19:50:59,207 INFO L136 LiptonReduction]: Total number of compositions: 94 [2023-08-29 19:50:59,219 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 19:50:59,224 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4bf4d96b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 19:50:59,225 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-08-29 19:50:59,226 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-08-29 19:50:59,227 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:50:59,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:50:59,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 19:50:59,228 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-29 19:50:59,232 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:50:59,232 INFO L85 PathProgramCache]: Analyzing trace with hash 13255, now seen corresponding path program 1 times [2023-08-29 19:50:59,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:50:59,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057973014] [2023-08-29 19:50:59,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:50:59,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:50:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:50:59,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:50:59,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:50:59,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057973014] [2023-08-29 19:50:59,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057973014] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:50:59,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:50:59,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:50:59,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256295670] [2023-08-29 19:50:59,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:50:59,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 19:50:59,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:50:59,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 19:50:59,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 19:50:59,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 180 [2023-08-29 19:50:59,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 15 transitions, 35 flow. Second operand has 2 states, 2 states have (on average 78.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:50:59,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:50:59,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 180 [2023-08-29 19:50:59,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:50:59,438 INFO L130 PetriNetUnfolder]: 21/51 cut-off events. [2023-08-29 19:50:59,438 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:50:59,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 51 events. 21/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 132 event pairs, 16 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 90. Up to 51 conditions per place. [2023-08-29 19:50:59,440 INFO L137 encePairwiseOnDemand]: 177/180 looper letters, 11 selfloop transitions, 0 changer transitions 0/12 dead transitions. [2023-08-29 19:50:59,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 15 places, 12 transitions, 51 flow [2023-08-29 19:50:59,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 19:50:59,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 19:50:59,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 168 transitions. [2023-08-29 19:50:59,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2023-08-29 19:50:59,458 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 168 transitions. [2023-08-29 19:50:59,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 168 transitions. [2023-08-29 19:50:59,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:50:59,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 168 transitions. [2023-08-29 19:50:59,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 84.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:50:59,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:50:59,474 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:50:59,476 INFO L175 Difference]: Start difference. First operand has 17 places, 15 transitions, 35 flow. Second operand 2 states and 168 transitions. [2023-08-29 19:50:59,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 15 places, 12 transitions, 51 flow [2023-08-29 19:50:59,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 12 transitions, 51 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 19:50:59,480 INFO L231 Difference]: Finished difference. Result has 15 places, 12 transitions, 29 flow [2023-08-29 19:50:59,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=29, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=29, PETRI_PLACES=15, PETRI_TRANSITIONS=12} [2023-08-29 19:50:59,485 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, -2 predicate places. [2023-08-29 19:50:59,485 INFO L495 AbstractCegarLoop]: Abstraction has has 15 places, 12 transitions, 29 flow [2023-08-29 19:50:59,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 78.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:50:59,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:50:59,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 19:50:59,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 19:50:59,487 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-29 19:50:59,488 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:50:59,488 INFO L85 PathProgramCache]: Analyzing trace with hash 13250, now seen corresponding path program 1 times [2023-08-29 19:50:59,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:50:59,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150806517] [2023-08-29 19:50:59,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:50:59,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:50:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:50:59,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:50:59,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:50:59,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150806517] [2023-08-29 19:50:59,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150806517] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:50:59,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:50:59,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:50:59,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257275154] [2023-08-29 19:50:59,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:50:59,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:50:59,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:50:59,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:50:59,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:50:59,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 180 [2023-08-29 19:50:59,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 15 places, 12 transitions, 29 flow. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:50:59,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:50:59,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 180 [2023-08-29 19:50:59,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:50:59,676 INFO L130 PetriNetUnfolder]: 16/40 cut-off events. [2023-08-29 19:50:59,679 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:50:59,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 40 events. 16/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 91 event pairs, 12 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 82. Up to 39 conditions per place. [2023-08-29 19:50:59,680 INFO L137 encePairwiseOnDemand]: 178/180 looper letters, 9 selfloop transitions, 1 changer transitions 0/11 dead transitions. [2023-08-29 19:50:59,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 16 places, 11 transitions, 47 flow [2023-08-29 19:50:59,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:50:59,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:50:59,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2023-08-29 19:50:59,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2023-08-29 19:50:59,686 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 230 transitions. [2023-08-29 19:50:59,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 230 transitions. [2023-08-29 19:50:59,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:50:59,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 230 transitions. [2023-08-29 19:50:59,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:50:59,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:50:59,691 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:50:59,692 INFO L175 Difference]: Start difference. First operand has 15 places, 12 transitions, 29 flow. Second operand 3 states and 230 transitions. [2023-08-29 19:50:59,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 16 places, 11 transitions, 47 flow [2023-08-29 19:50:59,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 11 transitions, 47 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 19:50:59,693 INFO L231 Difference]: Finished difference. Result has 16 places, 11 transitions, 29 flow [2023-08-29 19:50:59,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=27, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=29, PETRI_PLACES=16, PETRI_TRANSITIONS=11} [2023-08-29 19:50:59,694 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, -1 predicate places. [2023-08-29 19:50:59,695 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 11 transitions, 29 flow [2023-08-29 19:50:59,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:50:59,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:50:59,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 19:50:59,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 19:50:59,696 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-29 19:50:59,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:50:59,699 INFO L85 PathProgramCache]: Analyzing trace with hash 13252, now seen corresponding path program 1 times [2023-08-29 19:50:59,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:50:59,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335895512] [2023-08-29 19:50:59,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:50:59,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:50:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:50:59,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:50:59,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:50:59,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335895512] [2023-08-29 19:50:59,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335895512] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:50:59,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:50:59,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:50:59,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103376198] [2023-08-29 19:50:59,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:50:59,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:50:59,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:50:59,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:50:59,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:50:59,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 180 [2023-08-29 19:50:59,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 16 places, 11 transitions, 29 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:50:59,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:50:59,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 180 [2023-08-29 19:50:59,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:50:59,793 INFO L130 PetriNetUnfolder]: 11/29 cut-off events. [2023-08-29 19:50:59,793 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:50:59,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 29 events. 11/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 57 event pairs, 8 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 61. Up to 28 conditions per place. [2023-08-29 19:50:59,794 INFO L137 encePairwiseOnDemand]: 178/180 looper letters, 7 selfloop transitions, 1 changer transitions 1/10 dead transitions. [2023-08-29 19:50:59,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 10 transitions, 45 flow [2023-08-29 19:50:59,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:50:59,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:50:59,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2023-08-29 19:50:59,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.412962962962963 [2023-08-29 19:50:59,800 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 223 transitions. [2023-08-29 19:50:59,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 223 transitions. [2023-08-29 19:50:59,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:50:59,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 223 transitions. [2023-08-29 19:50:59,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:50:59,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:50:59,803 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:50:59,803 INFO L175 Difference]: Start difference. First operand has 16 places, 11 transitions, 29 flow. Second operand 3 states and 223 transitions. [2023-08-29 19:50:59,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 10 transitions, 45 flow [2023-08-29 19:50:59,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 10 transitions, 44 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:50:59,804 INFO L231 Difference]: Finished difference. Result has 16 places, 9 transitions, 26 flow [2023-08-29 19:50:59,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=26, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=10, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=26, PETRI_PLACES=16, PETRI_TRANSITIONS=9} [2023-08-29 19:50:59,805 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, -1 predicate places. [2023-08-29 19:50:59,805 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 9 transitions, 26 flow [2023-08-29 19:50:59,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:50:59,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:50:59,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 19:50:59,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 19:50:59,806 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-29 19:50:59,807 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:50:59,807 INFO L85 PathProgramCache]: Analyzing trace with hash 395056421, now seen corresponding path program 1 times [2023-08-29 19:50:59,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:50:59,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571247161] [2023-08-29 19:50:59,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:50:59,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:50:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:50:59,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:50:59,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:50:59,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571247161] [2023-08-29 19:50:59,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571247161] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:50:59,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:50:59,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:50:59,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562399176] [2023-08-29 19:50:59,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:50:59,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:50:59,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:50:59,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:50:59,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:50:59,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 180 [2023-08-29 19:50:59,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 16 places, 9 transitions, 26 flow. Second operand has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:50:59,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:50:59,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 180 [2023-08-29 19:50:59,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:00,000 INFO L130 PetriNetUnfolder]: 7/19 cut-off events. [2023-08-29 19:51:00,000 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:51:00,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 19 events. 7/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 23 event pairs, 4 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 42. Up to 18 conditions per place. [2023-08-29 19:51:00,001 INFO L137 encePairwiseOnDemand]: 178/180 looper letters, 6 selfloop transitions, 1 changer transitions 0/8 dead transitions. [2023-08-29 19:51:00,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 16 places, 8 transitions, 38 flow [2023-08-29 19:51:00,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:51:00,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:51:00,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 212 transitions. [2023-08-29 19:51:00,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3925925925925926 [2023-08-29 19:51:00,003 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 212 transitions. [2023-08-29 19:51:00,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 212 transitions. [2023-08-29 19:51:00,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:00,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 212 transitions. [2023-08-29 19:51:00,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:00,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:00,006 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:00,006 INFO L175 Difference]: Start difference. First operand has 16 places, 9 transitions, 26 flow. Second operand 3 states and 212 transitions. [2023-08-29 19:51:00,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 16 places, 8 transitions, 38 flow [2023-08-29 19:51:00,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 8 transitions, 37 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:51:00,007 INFO L231 Difference]: Finished difference. Result has 15 places, 8 transitions, 25 flow [2023-08-29 19:51:00,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=23, PETRI_DIFFERENCE_MINUEND_PLACES=13, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=25, PETRI_PLACES=15, PETRI_TRANSITIONS=8} [2023-08-29 19:51:00,008 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, -2 predicate places. [2023-08-29 19:51:00,008 INFO L495 AbstractCegarLoop]: Abstraction has has 15 places, 8 transitions, 25 flow [2023-08-29 19:51:00,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:00,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:00,009 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 19:51:00,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 19:51:00,009 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-29 19:51:00,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:00,010 INFO L85 PathProgramCache]: Analyzing trace with hash 395056422, now seen corresponding path program 1 times [2023-08-29 19:51:00,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:00,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956369169] [2023-08-29 19:51:00,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:00,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:00,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:51:00,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:00,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956369169] [2023-08-29 19:51:00,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956369169] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:00,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:00,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:51:00,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189610494] [2023-08-29 19:51:00,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:00,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:51:00,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:00,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:51:00,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:51:00,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 180 [2023-08-29 19:51:00,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 15 places, 8 transitions, 25 flow. Second operand has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:00,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:00,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 180 [2023-08-29 19:51:00,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:00,254 INFO L130 PetriNetUnfolder]: 9/24 cut-off events. [2023-08-29 19:51:00,254 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:51:00,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 24 events. 9/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 4 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 53. Up to 18 conditions per place. [2023-08-29 19:51:00,255 INFO L137 encePairwiseOnDemand]: 176/180 looper letters, 7 selfloop transitions, 3 changer transitions 0/11 dead transitions. [2023-08-29 19:51:00,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 18 places, 11 transitions, 51 flow [2023-08-29 19:51:00,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:51:00,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:51:00,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 287 transitions. [2023-08-29 19:51:00,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39861111111111114 [2023-08-29 19:51:00,257 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 287 transitions. [2023-08-29 19:51:00,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 287 transitions. [2023-08-29 19:51:00,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:00,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 287 transitions. [2023-08-29 19:51:00,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 71.75) internal successors, (287), 4 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:00,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:00,260 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:00,260 INFO L175 Difference]: Start difference. First operand has 15 places, 8 transitions, 25 flow. Second operand 4 states and 287 transitions. [2023-08-29 19:51:00,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 18 places, 11 transitions, 51 flow [2023-08-29 19:51:00,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 11 transitions, 50 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:51:00,261 INFO L231 Difference]: Finished difference. Result has 18 places, 9 transitions, 38 flow [2023-08-29 19:51:00,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=24, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=5, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=38, PETRI_PLACES=18, PETRI_TRANSITIONS=9} [2023-08-29 19:51:00,262 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, 1 predicate places. [2023-08-29 19:51:00,262 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 9 transitions, 38 flow [2023-08-29 19:51:00,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:00,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:00,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-29 19:51:00,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 19:51:00,263 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-29 19:51:00,264 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:00,264 INFO L85 PathProgramCache]: Analyzing trace with hash -638150960, now seen corresponding path program 1 times [2023-08-29 19:51:00,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:00,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737177094] [2023-08-29 19:51:00,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:00,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:00,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:51:00,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:00,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737177094] [2023-08-29 19:51:00,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737177094] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:51:00,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523503391] [2023-08-29 19:51:00,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:00,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:00,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:51:00,533 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) [2023-08-29 19:51:00,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-29 19:51:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:00,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-29 19:51:00,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:51:00,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:51:00,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:51:00,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:51:00,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:51:01,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:51:01,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523503391] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:51:01,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:51:01,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2023-08-29 19:51:01,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372692085] [2023-08-29 19:51:01,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:51:01,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 19:51:01,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:01,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 19:51:01,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-08-29 19:51:01,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 180 [2023-08-29 19:51:01,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 9 transitions, 38 flow. Second operand has 11 states, 11 states have (on average 69.63636363636364) internal successors, (766), 11 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:01,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:01,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 180 [2023-08-29 19:51:01,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:01,466 INFO L130 PetriNetUnfolder]: 11/29 cut-off events. [2023-08-29 19:51:01,466 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-08-29 19:51:01,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 29 events. 11/29 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 2 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 82. Up to 13 conditions per place. [2023-08-29 19:51:01,467 INFO L137 encePairwiseOnDemand]: 176/180 looper letters, 10 selfloop transitions, 5 changer transitions 0/16 dead transitions. [2023-08-29 19:51:01,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 16 transitions, 84 flow [2023-08-29 19:51:01,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:51:01,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:51:01,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 424 transitions. [2023-08-29 19:51:01,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3925925925925926 [2023-08-29 19:51:01,469 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 424 transitions. [2023-08-29 19:51:01,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 424 transitions. [2023-08-29 19:51:01,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:01,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 424 transitions. [2023-08-29 19:51:01,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 70.66666666666667) internal successors, (424), 6 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:01,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:01,474 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:01,475 INFO L175 Difference]: Start difference. First operand has 18 places, 9 transitions, 38 flow. Second operand 6 states and 424 transitions. [2023-08-29 19:51:01,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 16 transitions, 84 flow [2023-08-29 19:51:01,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 16 transitions, 78 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 19:51:01,476 INFO L231 Difference]: Finished difference. Result has 22 places, 10 transitions, 50 flow [2023-08-29 19:51:01,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=9, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=50, PETRI_PLACES=22, PETRI_TRANSITIONS=10} [2023-08-29 19:51:01,480 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, 5 predicate places. [2023-08-29 19:51:01,480 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 10 transitions, 50 flow [2023-08-29 19:51:01,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 69.63636363636364) internal successors, (766), 11 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:01,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:01,481 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-29 19:51:01,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-29 19:51:01,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-08-29 19:51:01,688 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-29 19:51:01,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:01,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1692158566, now seen corresponding path program 2 times [2023-08-29 19:51:01,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:01,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728999890] [2023-08-29 19:51:01,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:01,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:01,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:51:01,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:01,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728999890] [2023-08-29 19:51:01,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728999890] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:51:01,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956483594] [2023-08-29 19:51:01,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 19:51:01,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:01,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:51:01,753 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) [2023-08-29 19:51:01,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-29 19:51:01,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 19:51:01,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:51:01,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 19:51:01,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:51:01,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:51:01,834 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:51:01,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956483594] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:01,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 19:51:01,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-29 19:51:01,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439738048] [2023-08-29 19:51:01,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:01,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:51:01,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:01,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:51:01,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:51:01,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 180 [2023-08-29 19:51:01,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 10 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 71.4) internal successors, (357), 5 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:01,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:01,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 180 [2023-08-29 19:51:01,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:01,881 INFO L130 PetriNetUnfolder]: 6/21 cut-off events. [2023-08-29 19:51:01,881 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-08-29 19:51:01,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 21 events. 6/21 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 6/27 useless extension candidates. Maximal degree in co-relation 66. Up to 7 conditions per place. [2023-08-29 19:51:01,884 INFO L137 encePairwiseOnDemand]: 177/180 looper letters, 0 selfloop transitions, 0 changer transitions 14/14 dead transitions. [2023-08-29 19:51:01,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 14 transitions, 76 flow [2023-08-29 19:51:01,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 19:51:01,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 19:51:01,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 365 transitions. [2023-08-29 19:51:01,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40555555555555556 [2023-08-29 19:51:01,886 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 365 transitions. [2023-08-29 19:51:01,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 365 transitions. [2023-08-29 19:51:01,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:01,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 365 transitions. [2023-08-29 19:51:01,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:01,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:01,896 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:01,896 INFO L175 Difference]: Start difference. First operand has 22 places, 10 transitions, 50 flow. Second operand 5 states and 365 transitions. [2023-08-29 19:51:01,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 14 transitions, 76 flow [2023-08-29 19:51:01,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 14 transitions, 61 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-08-29 19:51:01,898 INFO L231 Difference]: Finished difference. Result has 18 places, 0 transitions, 0 flow [2023-08-29 19:51:01,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=23, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=18, PETRI_TRANSITIONS=0} [2023-08-29 19:51:01,898 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, 1 predicate places. [2023-08-29 19:51:01,899 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 0 transitions, 0 flow [2023-08-29 19:51:01,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.4) internal successors, (357), 5 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:01,901 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 9 remaining) [2023-08-29 19:51:01,902 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2023-08-29 19:51:01,902 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2023-08-29 19:51:01,902 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2023-08-29 19:51:01,902 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (4 of 9 remaining) [2023-08-29 19:51:01,902 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 9 remaining) [2023-08-29 19:51:01,903 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 9 remaining) [2023-08-29 19:51:01,905 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (1 of 9 remaining) [2023-08-29 19:51:01,905 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 9 remaining) [2023-08-29 19:51:01,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-29 19:51:02,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-08-29 19:51:02,111 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-08-29 19:51:02,113 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-29 19:51:02,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 86 transitions, 177 flow [2023-08-29 19:51:02,129 INFO L130 PetriNetUnfolder]: 9/101 cut-off events. [2023-08-29 19:51:02,130 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:51:02,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 101 events. 9/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 137 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 63. Up to 4 conditions per place. [2023-08-29 19:51:02,130 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 86 transitions, 177 flow [2023-08-29 19:51:02,131 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 86 transitions, 177 flow [2023-08-29 19:51:02,131 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 19:51:02,131 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 86 transitions, 177 flow [2023-08-29 19:51:02,132 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 86 transitions, 177 flow [2023-08-29 19:51:02,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 86 transitions, 177 flow [2023-08-29 19:51:02,139 INFO L130 PetriNetUnfolder]: 9/101 cut-off events. [2023-08-29 19:51:02,140 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:51:02,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 101 events. 9/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 137 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 63. Up to 4 conditions per place. [2023-08-29 19:51:02,141 INFO L119 LiptonReduction]: Number of co-enabled transitions 1656 [2023-08-29 19:51:04,649 INFO L134 LiptonReduction]: Checked pairs total: 1581 [2023-08-29 19:51:04,650 INFO L136 LiptonReduction]: Total number of compositions: 95 [2023-08-29 19:51:04,651 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-29 19:51:04,652 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4bf4d96b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 19:51:04,652 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-29 19:51:04,655 INFO L130 PetriNetUnfolder]: 1/19 cut-off events. [2023-08-29 19:51:04,655 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:51:04,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:04,655 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-29 19:51:04,655 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 19:51:04,656 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:04,656 INFO L85 PathProgramCache]: Analyzing trace with hash 2107505026, now seen corresponding path program 1 times [2023-08-29 19:51:04,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:04,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267648744] [2023-08-29 19:51:04,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:04,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 19:51:04,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 19:51:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 19:51:04,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 19:51:04,695 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 19:51:04,697 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-29 19:51:04,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 19:51:04,698 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-29 19:51:04,700 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-29 19:51:04,700 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 19:51:04,700 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-29 19:51:04,725 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 19:51:04,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 133 transitions, 278 flow [2023-08-29 19:51:04,741 INFO L130 PetriNetUnfolder]: 17/165 cut-off events. [2023-08-29 19:51:04,741 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 19:51:04,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 165 events. 17/165 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 364 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 109. Up to 6 conditions per place. [2023-08-29 19:51:04,742 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 133 transitions, 278 flow [2023-08-29 19:51:04,744 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 133 transitions, 278 flow [2023-08-29 19:51:04,744 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 19:51:04,744 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 133 transitions, 278 flow [2023-08-29 19:51:04,745 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 133 transitions, 278 flow [2023-08-29 19:51:04,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 133 transitions, 278 flow [2023-08-29 19:51:04,762 INFO L130 PetriNetUnfolder]: 17/165 cut-off events. [2023-08-29 19:51:04,762 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 19:51:04,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 165 events. 17/165 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 364 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 109. Up to 6 conditions per place. [2023-08-29 19:51:04,767 INFO L119 LiptonReduction]: Number of co-enabled transitions 7636 [2023-08-29 19:51:07,410 INFO L134 LiptonReduction]: Checked pairs total: 11669 [2023-08-29 19:51:07,411 INFO L136 LiptonReduction]: Total number of compositions: 127 [2023-08-29 19:51:07,412 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 19:51:07,412 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4bf4d96b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 19:51:07,413 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-08-29 19:51:07,414 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 19:51:07,414 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:51:07,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:07,414 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 19:51:07,414 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-29 19:51:07,414 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:07,415 INFO L85 PathProgramCache]: Analyzing trace with hash 26043, now seen corresponding path program 1 times [2023-08-29 19:51:07,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:07,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78307958] [2023-08-29 19:51:07,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:07,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:07,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:51:07,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:07,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78307958] [2023-08-29 19:51:07,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78307958] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:07,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:07,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:51:07,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058635206] [2023-08-29 19:51:07,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:07,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:51:07,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:07,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:51:07,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:51:07,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 260 [2023-08-29 19:51:07,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 39 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:07,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:07,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 260 [2023-08-29 19:51:07,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:07,541 INFO L130 PetriNetUnfolder]: 291/578 cut-off events. [2023-08-29 19:51:07,542 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2023-08-29 19:51:07,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1055 conditions, 578 events. 291/578 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3154 event pairs, 222 based on Foata normal form. 44/395 useless extension candidates. Maximal degree in co-relation 255. Up to 438 conditions per place. [2023-08-29 19:51:07,545 INFO L137 encePairwiseOnDemand]: 252/260 looper letters, 18 selfloop transitions, 1 changer transitions 0/32 dead transitions. [2023-08-29 19:51:07,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 114 flow [2023-08-29 19:51:07,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:51:07,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:51:07,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2023-08-29 19:51:07,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46794871794871795 [2023-08-29 19:51:07,547 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2023-08-29 19:51:07,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2023-08-29 19:51:07,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:07,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2023-08-29 19:51:07,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:07,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:07,551 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:07,551 INFO L175 Difference]: Start difference. First operand has 36 places, 39 transitions, 90 flow. Second operand 3 states and 365 transitions. [2023-08-29 19:51:07,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 114 flow [2023-08-29 19:51:07,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 112 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-29 19:51:07,563 INFO L231 Difference]: Finished difference. Result has 35 places, 32 transitions, 76 flow [2023-08-29 19:51:07,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=35, PETRI_TRANSITIONS=32} [2023-08-29 19:51:07,565 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2023-08-29 19:51:07,566 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 32 transitions, 76 flow [2023-08-29 19:51:07,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:07,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:07,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 19:51:07,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 19:51:07,567 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-29 19:51:07,567 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:07,568 INFO L85 PathProgramCache]: Analyzing trace with hash 26044, now seen corresponding path program 1 times [2023-08-29 19:51:07,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:07,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124508612] [2023-08-29 19:51:07,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:07,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:07,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:51:07,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:07,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124508612] [2023-08-29 19:51:07,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124508612] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:07,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:07,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:51:07,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926402794] [2023-08-29 19:51:07,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:07,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:51:07,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:07,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:51:07,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:51:07,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 260 [2023-08-29 19:51:07,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:07,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:07,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 260 [2023-08-29 19:51:07,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:07,665 INFO L130 PetriNetUnfolder]: 178/376 cut-off events. [2023-08-29 19:51:07,665 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2023-08-29 19:51:07,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 376 events. 178/376 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1842 event pairs, 132 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 679. Up to 276 conditions per place. [2023-08-29 19:51:07,669 INFO L137 encePairwiseOnDemand]: 258/260 looper letters, 17 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2023-08-29 19:51:07,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 110 flow [2023-08-29 19:51:07,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:51:07,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:51:07,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2023-08-29 19:51:07,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4512820512820513 [2023-08-29 19:51:07,671 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2023-08-29 19:51:07,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2023-08-29 19:51:07,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:07,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2023-08-29 19:51:07,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:07,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:07,674 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:07,674 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 76 flow. Second operand 3 states and 352 transitions. [2023-08-29 19:51:07,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 110 flow [2023-08-29 19:51:07,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 109 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:51:07,676 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 75 flow [2023-08-29 19:51:07,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2023-08-29 19:51:07,677 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2023-08-29 19:51:07,677 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 75 flow [2023-08-29 19:51:07,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:07,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:07,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 19:51:07,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 19:51:07,678 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-29 19:51:07,678 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:07,678 INFO L85 PathProgramCache]: Analyzing trace with hash 776479540, now seen corresponding path program 1 times [2023-08-29 19:51:07,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:07,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370193982] [2023-08-29 19:51:07,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:07,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:51:07,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:07,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370193982] [2023-08-29 19:51:07,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370193982] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:07,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:07,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:51:07,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163621797] [2023-08-29 19:51:07,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:07,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:51:07,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:07,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:51:07,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:51:07,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 260 [2023-08-29 19:51:07,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:07,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:07,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 260 [2023-08-29 19:51:07,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:07,945 INFO L130 PetriNetUnfolder]: 222/444 cut-off events. [2023-08-29 19:51:07,946 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2023-08-29 19:51:07,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 444 events. 222/444 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2303 event pairs, 132 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 831. Up to 276 conditions per place. [2023-08-29 19:51:07,948 INFO L137 encePairwiseOnDemand]: 255/260 looper letters, 26 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2023-08-29 19:51:07,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 160 flow [2023-08-29 19:51:07,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:51:07,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:51:07,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 467 transitions. [2023-08-29 19:51:07,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44903846153846155 [2023-08-29 19:51:07,951 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 467 transitions. [2023-08-29 19:51:07,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 467 transitions. [2023-08-29 19:51:07,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:07,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 467 transitions. [2023-08-29 19:51:07,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:07,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:07,955 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:07,955 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 75 flow. Second operand 4 states and 467 transitions. [2023-08-29 19:51:07,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 160 flow [2023-08-29 19:51:07,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 159 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:51:07,957 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 90 flow [2023-08-29 19:51:07,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2023-08-29 19:51:07,958 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2023-08-29 19:51:07,959 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 90 flow [2023-08-29 19:51:07,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:07,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:07,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 19:51:07,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 19:51:07,960 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-29 19:51:07,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:07,960 INFO L85 PathProgramCache]: Analyzing trace with hash 776479539, now seen corresponding path program 1 times [2023-08-29 19:51:07,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:07,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187919972] [2023-08-29 19:51:07,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:07,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:08,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:51:08,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:08,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187919972] [2023-08-29 19:51:08,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187919972] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:08,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:08,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:51:08,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356566407] [2023-08-29 19:51:08,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:08,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:51:08,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:08,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:51:08,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:51:08,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 260 [2023-08-29 19:51:08,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:08,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:08,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 260 [2023-08-29 19:51:08,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:08,154 INFO L130 PetriNetUnfolder]: 155/331 cut-off events. [2023-08-29 19:51:08,154 INFO L131 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2023-08-29 19:51:08,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 331 events. 155/331 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1556 event pairs, 113 based on Foata normal form. 28/277 useless extension candidates. Maximal degree in co-relation 683. Up to 241 conditions per place. [2023-08-29 19:51:08,156 INFO L137 encePairwiseOnDemand]: 257/260 looper letters, 16 selfloop transitions, 1 changer transitions 0/30 dead transitions. [2023-08-29 19:51:08,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 30 transitions, 120 flow [2023-08-29 19:51:08,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:51:08,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:51:08,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2023-08-29 19:51:08,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4307692307692308 [2023-08-29 19:51:08,158 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2023-08-29 19:51:08,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2023-08-29 19:51:08,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:08,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2023-08-29 19:51:08,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:08,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:08,162 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:08,162 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 90 flow. Second operand 3 states and 336 transitions. [2023-08-29 19:51:08,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 30 transitions, 120 flow [2023-08-29 19:51:08,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 30 transitions, 114 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 19:51:08,164 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 82 flow [2023-08-29 19:51:08,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2023-08-29 19:51:08,166 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2023-08-29 19:51:08,166 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 82 flow [2023-08-29 19:51:08,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:08,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:08,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-29 19:51:08,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 19:51:08,167 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-29 19:51:08,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:08,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1698935274, now seen corresponding path program 1 times [2023-08-29 19:51:08,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:08,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555932609] [2023-08-29 19:51:08,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:08,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:08,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:51:08,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:08,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555932609] [2023-08-29 19:51:08,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555932609] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:51:08,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056597604] [2023-08-29 19:51:08,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:08,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:08,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:51:08,341 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) [2023-08-29 19:51:08,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-29 19:51:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:08,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-29 19:51:08,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:51:08,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:51:08,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:51:08,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:51:08,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:51:08,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:51:08,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056597604] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:51:08,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:51:08,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2023-08-29 19:51:08,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123774318] [2023-08-29 19:51:08,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:51:08,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 19:51:08,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:08,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 19:51:08,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-08-29 19:51:08,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 260 [2023-08-29 19:51:08,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 82 flow. Second operand has 11 states, 11 states have (on average 108.63636363636364) internal successors, (1195), 11 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:08,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:08,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 260 [2023-08-29 19:51:08,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:09,186 INFO L130 PetriNetUnfolder]: 453/961 cut-off events. [2023-08-29 19:51:09,186 INFO L131 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2023-08-29 19:51:09,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1848 conditions, 961 events. 453/961 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6256 event pairs, 77 based on Foata normal form. 0/737 useless extension candidates. Maximal degree in co-relation 1837. Up to 184 conditions per place. [2023-08-29 19:51:09,192 INFO L137 encePairwiseOnDemand]: 256/260 looper letters, 55 selfloop transitions, 7 changer transitions 0/75 dead transitions. [2023-08-29 19:51:09,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 75 transitions, 330 flow [2023-08-29 19:51:09,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 19:51:09,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 19:51:09,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 813 transitions. [2023-08-29 19:51:09,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4467032967032967 [2023-08-29 19:51:09,195 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 813 transitions. [2023-08-29 19:51:09,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 813 transitions. [2023-08-29 19:51:09,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:09,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 813 transitions. [2023-08-29 19:51:09,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:09,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:09,202 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:09,202 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 82 flow. Second operand 7 states and 813 transitions. [2023-08-29 19:51:09,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 75 transitions, 330 flow [2023-08-29 19:51:09,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 75 transitions, 329 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:51:09,204 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 127 flow [2023-08-29 19:51:09,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=127, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-08-29 19:51:09,205 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2023-08-29 19:51:09,205 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 127 flow [2023-08-29 19:51:09,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 108.63636363636364) internal successors, (1195), 11 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:09,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:09,206 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-29 19:51:09,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-29 19:51:09,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:09,411 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-29 19:51:09,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:09,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1127383180, now seen corresponding path program 2 times [2023-08-29 19:51:09,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:09,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37323599] [2023-08-29 19:51:09,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:09,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:09,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:51:09,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:09,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37323599] [2023-08-29 19:51:09,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37323599] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:51:09,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521150598] [2023-08-29 19:51:09,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 19:51:09,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:09,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:51:09,453 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) [2023-08-29 19:51:09,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-29 19:51:09,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 19:51:09,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:51:09,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 19:51:09,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:51:09,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:51:09,524 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:51:09,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521150598] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:09,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 19:51:09,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-29 19:51:09,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953177576] [2023-08-29 19:51:09,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:09,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:51:09,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:09,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:51:09,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:51:09,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 260 [2023-08-29 19:51:09,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 127 flow. Second operand has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:09,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:09,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 260 [2023-08-29 19:51:09,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:09,636 INFO L130 PetriNetUnfolder]: 217/484 cut-off events. [2023-08-29 19:51:09,636 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2023-08-29 19:51:09,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 985 conditions, 484 events. 217/484 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2801 event pairs, 5 based on Foata normal form. 28/441 useless extension candidates. Maximal degree in co-relation 976. Up to 238 conditions per place. [2023-08-29 19:51:09,639 INFO L137 encePairwiseOnDemand]: 256/260 looper letters, 37 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2023-08-29 19:51:09,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 54 transitions, 238 flow [2023-08-29 19:51:09,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 19:51:09,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 19:51:09,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2023-08-29 19:51:09,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45615384615384613 [2023-08-29 19:51:09,641 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 593 transitions. [2023-08-29 19:51:09,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 593 transitions. [2023-08-29 19:51:09,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:09,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 593 transitions. [2023-08-29 19:51:09,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:09,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:09,645 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:09,645 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 127 flow. Second operand 5 states and 593 transitions. [2023-08-29 19:51:09,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 54 transitions, 238 flow [2023-08-29 19:51:09,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 54 transitions, 229 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-29 19:51:09,647 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 97 flow [2023-08-29 19:51:09,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=97, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-08-29 19:51:09,648 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2023-08-29 19:51:09,648 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 97 flow [2023-08-29 19:51:09,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:09,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:09,649 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:09,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-29 19:51:09,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:09,854 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-29 19:51:09,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:09,854 INFO L85 PathProgramCache]: Analyzing trace with hash -614236643, now seen corresponding path program 1 times [2023-08-29 19:51:09,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:09,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336203837] [2023-08-29 19:51:09,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:09,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:09,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 19:51:09,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:09,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336203837] [2023-08-29 19:51:09,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336203837] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:09,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:09,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:51:09,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834247028] [2023-08-29 19:51:09,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:09,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:51:09,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:09,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:51:09,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:51:10,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 260 [2023-08-29 19:51:10,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:10,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:10,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 260 [2023-08-29 19:51:10,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:10,132 INFO L130 PetriNetUnfolder]: 345/771 cut-off events. [2023-08-29 19:51:10,133 INFO L131 PetriNetUnfolder]: For 392/392 co-relation queries the response was YES. [2023-08-29 19:51:10,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1627 conditions, 771 events. 345/771 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4840 event pairs, 167 based on Foata normal form. 0/660 useless extension candidates. Maximal degree in co-relation 1619. Up to 329 conditions per place. [2023-08-29 19:51:10,137 INFO L137 encePairwiseOnDemand]: 256/260 looper letters, 26 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2023-08-29 19:51:10,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 42 transitions, 203 flow [2023-08-29 19:51:10,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:51:10,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:51:10,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 462 transitions. [2023-08-29 19:51:10,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4442307692307692 [2023-08-29 19:51:10,139 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 462 transitions. [2023-08-29 19:51:10,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 462 transitions. [2023-08-29 19:51:10,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:10,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 462 transitions. [2023-08-29 19:51:10,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:10,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:10,143 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:10,143 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 97 flow. Second operand 4 states and 462 transitions. [2023-08-29 19:51:10,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 42 transitions, 203 flow [2023-08-29 19:51:10,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 181 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-29 19:51:10,144 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 100 flow [2023-08-29 19:51:10,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2023-08-29 19:51:10,145 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2023-08-29 19:51:10,145 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 100 flow [2023-08-29 19:51:10,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:10,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:10,145 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:10,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 19:51:10,146 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-29 19:51:10,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:10,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1861463681, now seen corresponding path program 1 times [2023-08-29 19:51:10,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:10,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727792470] [2023-08-29 19:51:10,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:10,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:10,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 19:51:10,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:10,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727792470] [2023-08-29 19:51:10,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727792470] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:51:10,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163915868] [2023-08-29 19:51:10,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:10,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:10,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:51:10,321 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) [2023-08-29 19:51:10,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-29 19:51:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:10,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-29 19:51:10,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:51:10,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:51:10,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:51:10,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 19:51:10,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:51:10,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 19:51:10,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163915868] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:51:10,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:51:10,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2023-08-29 19:51:10,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470713354] [2023-08-29 19:51:10,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:51:10,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 19:51:10,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:10,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 19:51:10,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-08-29 19:51:10,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 260 [2023-08-29 19:51:10,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 100 flow. Second operand has 11 states, 11 states have (on average 109.9090909090909) internal successors, (1209), 11 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:10,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:10,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 260 [2023-08-29 19:51:10,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:11,204 INFO L130 PetriNetUnfolder]: 477/1063 cut-off events. [2023-08-29 19:51:11,204 INFO L131 PetriNetUnfolder]: For 251/251 co-relation queries the response was YES. [2023-08-29 19:51:11,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2187 conditions, 1063 events. 477/1063 cut-off events. For 251/251 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7227 event pairs, 139 based on Foata normal form. 0/972 useless extension candidates. Maximal degree in co-relation 2178. Up to 281 conditions per place. [2023-08-29 19:51:11,211 INFO L137 encePairwiseOnDemand]: 256/260 looper letters, 44 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2023-08-29 19:51:11,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 62 transitions, 301 flow [2023-08-29 19:51:11,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:51:11,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:51:11,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 690 transitions. [2023-08-29 19:51:11,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4423076923076923 [2023-08-29 19:51:11,214 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 690 transitions. [2023-08-29 19:51:11,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 690 transitions. [2023-08-29 19:51:11,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:11,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 690 transitions. [2023-08-29 19:51:11,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:11,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 260.0) internal successors, (1820), 7 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:11,218 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 260.0) internal successors, (1820), 7 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:11,218 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 100 flow. Second operand 6 states and 690 transitions. [2023-08-29 19:51:11,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 62 transitions, 301 flow [2023-08-29 19:51:11,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 62 transitions, 297 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:51:11,220 INFO L231 Difference]: Finished difference. Result has 47 places, 32 transitions, 114 flow [2023-08-29 19:51:11,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=114, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2023-08-29 19:51:11,222 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2023-08-29 19:51:11,222 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 114 flow [2023-08-29 19:51:11,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 109.9090909090909) internal successors, (1209), 11 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:11,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:11,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:11,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-29 19:51:11,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-29 19:51:11,428 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-29 19:51:11,428 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:11,428 INFO L85 PathProgramCache]: Analyzing trace with hash 713147874, now seen corresponding path program 1 times [2023-08-29 19:51:11,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:11,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811405976] [2023-08-29 19:51:11,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:11,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:11,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:11,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 19:51:11,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:11,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811405976] [2023-08-29 19:51:11,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811405976] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:11,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:11,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:51:11,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820385962] [2023-08-29 19:51:11,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:11,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:51:11,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:11,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:51:11,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:51:11,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 260 [2023-08-29 19:51:11,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 32 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:11,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:11,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 260 [2023-08-29 19:51:11,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:11,635 INFO L130 PetriNetUnfolder]: 869/1764 cut-off events. [2023-08-29 19:51:11,636 INFO L131 PetriNetUnfolder]: For 465/465 co-relation queries the response was YES. [2023-08-29 19:51:11,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3822 conditions, 1764 events. 869/1764 cut-off events. For 465/465 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 12660 event pairs, 403 based on Foata normal form. 0/1611 useless extension candidates. Maximal degree in co-relation 3812. Up to 890 conditions per place. [2023-08-29 19:51:11,645 INFO L137 encePairwiseOnDemand]: 255/260 looper letters, 32 selfloop transitions, 4 changer transitions 1/45 dead transitions. [2023-08-29 19:51:11,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 241 flow [2023-08-29 19:51:11,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:51:11,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:51:11,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-08-29 19:51:11,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45256410256410257 [2023-08-29 19:51:11,647 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-08-29 19:51:11,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-08-29 19:51:11,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:11,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-08-29 19:51:11,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:11,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:11,650 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:11,650 INFO L175 Difference]: Start difference. First operand has 47 places, 32 transitions, 114 flow. Second operand 3 states and 353 transitions. [2023-08-29 19:51:11,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 241 flow [2023-08-29 19:51:11,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 45 transitions, 232 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-29 19:51:11,653 INFO L231 Difference]: Finished difference. Result has 49 places, 34 transitions, 135 flow [2023-08-29 19:51:11,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2023-08-29 19:51:11,653 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2023-08-29 19:51:11,653 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 135 flow [2023-08-29 19:51:11,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:11,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:11,654 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:11,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 19:51:11,654 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-29 19:51:11,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:11,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1870796195, now seen corresponding path program 2 times [2023-08-29 19:51:11,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:11,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298635346] [2023-08-29 19:51:11,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:11,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:11,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 19:51:11,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:11,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298635346] [2023-08-29 19:51:11,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298635346] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:11,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:11,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 19:51:11,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349913522] [2023-08-29 19:51:11,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:11,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:51:11,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:11,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:51:11,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:51:11,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 260 [2023-08-29 19:51:11,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:11,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:11,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 260 [2023-08-29 19:51:11,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:11,838 INFO L130 PetriNetUnfolder]: 501/1259 cut-off events. [2023-08-29 19:51:11,838 INFO L131 PetriNetUnfolder]: For 417/429 co-relation queries the response was YES. [2023-08-29 19:51:11,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2721 conditions, 1259 events. 501/1259 cut-off events. For 417/429 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9558 event pairs, 27 based on Foata normal form. 40/1234 useless extension candidates. Maximal degree in co-relation 2710. Up to 648 conditions per place. [2023-08-29 19:51:11,845 INFO L137 encePairwiseOnDemand]: 256/260 looper letters, 39 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2023-08-29 19:51:11,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 58 transitions, 308 flow [2023-08-29 19:51:11,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 19:51:11,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 19:51:11,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2023-08-29 19:51:11,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45153846153846156 [2023-08-29 19:51:11,847 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 587 transitions. [2023-08-29 19:51:11,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 587 transitions. [2023-08-29 19:51:11,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:11,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 587 transitions. [2023-08-29 19:51:11,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:11,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:11,851 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:11,851 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 135 flow. Second operand 5 states and 587 transitions. [2023-08-29 19:51:11,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 58 transitions, 308 flow [2023-08-29 19:51:11,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 293 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-29 19:51:11,877 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 124 flow [2023-08-29 19:51:11,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2023-08-29 19:51:11,877 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2023-08-29 19:51:11,877 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 124 flow [2023-08-29 19:51:11,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:11,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:11,878 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:11,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 19:51:11,878 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-29 19:51:11,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:11,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1689422831, now seen corresponding path program 1 times [2023-08-29 19:51:11,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:11,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161042730] [2023-08-29 19:51:11,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:11,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:11,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 19:51:11,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:11,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161042730] [2023-08-29 19:51:11,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161042730] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:11,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:11,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:51:11,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769301584] [2023-08-29 19:51:11,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:11,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:51:11,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:11,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:51:11,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:51:11,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 260 [2023-08-29 19:51:11,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:11,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:11,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 260 [2023-08-29 19:51:11,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:12,008 INFO L130 PetriNetUnfolder]: 373/923 cut-off events. [2023-08-29 19:51:12,008 INFO L131 PetriNetUnfolder]: For 243/251 co-relation queries the response was YES. [2023-08-29 19:51:12,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2038 conditions, 923 events. 373/923 cut-off events. For 243/251 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6335 event pairs, 291 based on Foata normal form. 20/898 useless extension candidates. Maximal degree in co-relation 2029. Up to 566 conditions per place. [2023-08-29 19:51:12,014 INFO L137 encePairwiseOnDemand]: 257/260 looper letters, 25 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-08-29 19:51:12,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 205 flow [2023-08-29 19:51:12,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:51:12,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:51:12,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2023-08-29 19:51:12,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4551282051282051 [2023-08-29 19:51:12,015 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2023-08-29 19:51:12,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2023-08-29 19:51:12,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:12,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2023-08-29 19:51:12,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:12,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:12,019 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:12,019 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 124 flow. Second operand 3 states and 355 transitions. [2023-08-29 19:51:12,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 205 flow [2023-08-29 19:51:12,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 196 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-29 19:51:12,021 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 115 flow [2023-08-29 19:51:12,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2023-08-29 19:51:12,022 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2023-08-29 19:51:12,022 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 115 flow [2023-08-29 19:51:12,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:12,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:12,022 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:12,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 19:51:12,022 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-29 19:51:12,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:12,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1457594799, now seen corresponding path program 1 times [2023-08-29 19:51:12,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:12,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906966215] [2023-08-29 19:51:12,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:12,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:12,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-29 19:51:12,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:12,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906966215] [2023-08-29 19:51:12,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906966215] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:12,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:12,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:51:12,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516689702] [2023-08-29 19:51:12,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:12,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:51:12,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:12,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:51:12,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:51:12,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 260 [2023-08-29 19:51:12,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:12,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:12,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 260 [2023-08-29 19:51:12,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:12,163 INFO L130 PetriNetUnfolder]: 464/836 cut-off events. [2023-08-29 19:51:12,164 INFO L131 PetriNetUnfolder]: For 253/257 co-relation queries the response was YES. [2023-08-29 19:51:12,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2092 conditions, 836 events. 464/836 cut-off events. For 253/257 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4549 event pairs, 228 based on Foata normal form. 0/788 useless extension candidates. Maximal degree in co-relation 2083. Up to 505 conditions per place. [2023-08-29 19:51:12,168 INFO L137 encePairwiseOnDemand]: 255/260 looper letters, 29 selfloop transitions, 4 changer transitions 3/44 dead transitions. [2023-08-29 19:51:12,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 226 flow [2023-08-29 19:51:12,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:51:12,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:51:12,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2023-08-29 19:51:12,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2023-08-29 19:51:12,170 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2023-08-29 19:51:12,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2023-08-29 19:51:12,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:12,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2023-08-29 19:51:12,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:12,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:12,173 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:12,173 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 115 flow. Second operand 3 states and 350 transitions. [2023-08-29 19:51:12,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 226 flow [2023-08-29 19:51:12,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:51:12,176 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 133 flow [2023-08-29 19:51:12,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2023-08-29 19:51:12,177 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2023-08-29 19:51:12,177 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 133 flow [2023-08-29 19:51:12,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:12,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:12,178 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:12,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 19:51:12,178 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-29 19:51:12,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:12,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1320855763, now seen corresponding path program 1 times [2023-08-29 19:51:12,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:12,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774074566] [2023-08-29 19:51:12,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:12,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:12,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 19:51:12,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:12,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774074566] [2023-08-29 19:51:12,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774074566] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:51:12,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104702469] [2023-08-29 19:51:12,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:12,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:12,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:51:12,221 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) [2023-08-29 19:51:12,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-29 19:51:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:12,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 19:51:12,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:51:12,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 19:51:12,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:51:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 19:51:12,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104702469] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:51:12,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:51:12,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-29 19:51:12,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016748916] [2023-08-29 19:51:12,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:51:12,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:51:12,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:12,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:51:12,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:51:12,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 260 [2023-08-29 19:51:12,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:12,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:12,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 260 [2023-08-29 19:51:12,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:12,397 INFO L130 PetriNetUnfolder]: 176/372 cut-off events. [2023-08-29 19:51:12,398 INFO L131 PetriNetUnfolder]: For 164/164 co-relation queries the response was YES. [2023-08-29 19:51:12,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 978 conditions, 372 events. 176/372 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1870 event pairs, 110 based on Foata normal form. 16/376 useless extension candidates. Maximal degree in co-relation 968. Up to 227 conditions per place. [2023-08-29 19:51:12,400 INFO L137 encePairwiseOnDemand]: 257/260 looper letters, 30 selfloop transitions, 3 changer transitions 2/50 dead transitions. [2023-08-29 19:51:12,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 50 transitions, 258 flow [2023-08-29 19:51:12,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:51:12,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:51:12,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 470 transitions. [2023-08-29 19:51:12,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4519230769230769 [2023-08-29 19:51:12,402 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 470 transitions. [2023-08-29 19:51:12,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 470 transitions. [2023-08-29 19:51:12,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:12,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 470 transitions. [2023-08-29 19:51:12,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:12,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:12,411 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:12,411 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 133 flow. Second operand 4 states and 470 transitions. [2023-08-29 19:51:12,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 50 transitions, 258 flow [2023-08-29 19:51:12,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:51:12,413 INFO L231 Difference]: Finished difference. Result has 48 places, 32 transitions, 126 flow [2023-08-29 19:51:12,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=48, PETRI_TRANSITIONS=32} [2023-08-29 19:51:12,414 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places. [2023-08-29 19:51:12,414 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 32 transitions, 126 flow [2023-08-29 19:51:12,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:12,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:12,418 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:12,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-29 19:51:12,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:12,624 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-29 19:51:12,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:12,625 INFO L85 PathProgramCache]: Analyzing trace with hash -149370497, now seen corresponding path program 2 times [2023-08-29 19:51:12,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:12,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897114660] [2023-08-29 19:51:12,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:12,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:12,668 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-29 19:51:12,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:12,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897114660] [2023-08-29 19:51:12,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897114660] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:51:12,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894734844] [2023-08-29 19:51:12,669 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 19:51:12,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:12,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:51:12,670 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) [2023-08-29 19:51:12,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-29 19:51:12,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 19:51:12,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:51:12,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 19:51:12,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:51:12,765 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-29 19:51:12,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:51:12,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894734844] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:12,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 19:51:12,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2023-08-29 19:51:12,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118059802] [2023-08-29 19:51:12,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:12,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:51:12,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:12,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:51:12,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 19:51:12,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 260 [2023-08-29 19:51:12,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 32 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:12,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:12,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 260 [2023-08-29 19:51:12,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:12,933 INFO L130 PetriNetUnfolder]: 328/608 cut-off events. [2023-08-29 19:51:12,934 INFO L131 PetriNetUnfolder]: For 329/329 co-relation queries the response was YES. [2023-08-29 19:51:12,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1670 conditions, 608 events. 328/608 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3034 event pairs, 165 based on Foata normal form. 6/608 useless extension candidates. Maximal degree in co-relation 1660. Up to 356 conditions per place. [2023-08-29 19:51:12,937 INFO L137 encePairwiseOnDemand]: 254/260 looper letters, 28 selfloop transitions, 5 changer transitions 12/50 dead transitions. [2023-08-29 19:51:12,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 50 transitions, 280 flow [2023-08-29 19:51:12,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 19:51:12,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 19:51:12,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 541 transitions. [2023-08-29 19:51:12,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41615384615384615 [2023-08-29 19:51:12,939 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 541 transitions. [2023-08-29 19:51:12,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 541 transitions. [2023-08-29 19:51:12,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:12,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 541 transitions. [2023-08-29 19:51:12,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:12,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:12,942 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:12,942 INFO L175 Difference]: Start difference. First operand has 48 places, 32 transitions, 126 flow. Second operand 5 states and 541 transitions. [2023-08-29 19:51:12,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 50 transitions, 280 flow [2023-08-29 19:51:12,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 268 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 19:51:12,944 INFO L231 Difference]: Finished difference. Result has 51 places, 32 transitions, 139 flow [2023-08-29 19:51:12,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=51, PETRI_TRANSITIONS=32} [2023-08-29 19:51:12,945 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2023-08-29 19:51:12,945 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 32 transitions, 139 flow [2023-08-29 19:51:12,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:12,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:12,945 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:12,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-29 19:51:13,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:13,150 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-29 19:51:13,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:13,150 INFO L85 PathProgramCache]: Analyzing trace with hash 823713949, now seen corresponding path program 3 times [2023-08-29 19:51:13,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:13,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846519662] [2023-08-29 19:51:13,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:13,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:13,225 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-29 19:51:13,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:13,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846519662] [2023-08-29 19:51:13,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846519662] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:51:13,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832394116] [2023-08-29 19:51:13,226 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 19:51:13,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:13,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:51:13,227 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) [2023-08-29 19:51:13,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-29 19:51:13,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 19:51:13,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:51:13,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 19:51:13,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:51:13,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-29 19:51:13,322 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:51:13,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832394116] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:13,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 19:51:13,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2023-08-29 19:51:13,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602115434] [2023-08-29 19:51:13,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:13,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:51:13,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:13,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:51:13,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-29 19:51:13,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 260 [2023-08-29 19:51:13,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 32 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:13,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:13,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 260 [2023-08-29 19:51:13,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:13,500 INFO L130 PetriNetUnfolder]: 321/603 cut-off events. [2023-08-29 19:51:13,501 INFO L131 PetriNetUnfolder]: For 430/430 co-relation queries the response was YES. [2023-08-29 19:51:13,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1694 conditions, 603 events. 321/603 cut-off events. For 430/430 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3041 event pairs, 237 based on Foata normal form. 6/602 useless extension candidates. Maximal degree in co-relation 1682. Up to 488 conditions per place. [2023-08-29 19:51:13,504 INFO L137 encePairwiseOnDemand]: 253/260 looper letters, 32 selfloop transitions, 5 changer transitions 10/52 dead transitions. [2023-08-29 19:51:13,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 52 transitions, 308 flow [2023-08-29 19:51:13,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 19:51:13,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 19:51:13,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 542 transitions. [2023-08-29 19:51:13,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4169230769230769 [2023-08-29 19:51:13,506 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 542 transitions. [2023-08-29 19:51:13,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 542 transitions. [2023-08-29 19:51:13,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:13,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 542 transitions. [2023-08-29 19:51:13,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:13,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:13,510 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:13,510 INFO L175 Difference]: Start difference. First operand has 51 places, 32 transitions, 139 flow. Second operand 5 states and 542 transitions. [2023-08-29 19:51:13,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 52 transitions, 308 flow [2023-08-29 19:51:13,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 299 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 19:51:13,513 INFO L231 Difference]: Finished difference. Result has 55 places, 32 transitions, 153 flow [2023-08-29 19:51:13,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=55, PETRI_TRANSITIONS=32} [2023-08-29 19:51:13,513 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2023-08-29 19:51:13,514 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 32 transitions, 153 flow [2023-08-29 19:51:13,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:13,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:13,514 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:13,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-29 19:51:13,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-08-29 19:51:13,719 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-29 19:51:13,719 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:13,719 INFO L85 PathProgramCache]: Analyzing trace with hash 505987035, now seen corresponding path program 1 times [2023-08-29 19:51:13,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:13,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505539797] [2023-08-29 19:51:13,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:13,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:13,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-29 19:51:13,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:13,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505539797] [2023-08-29 19:51:13,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505539797] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:51:13,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377055530] [2023-08-29 19:51:13,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:13,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:13,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:51:13,758 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) [2023-08-29 19:51:13,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-29 19:51:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:13,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 19:51:13,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:51:13,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-29 19:51:13,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:51:13,861 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-29 19:51:13,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377055530] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:51:13,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:51:13,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2023-08-29 19:51:13,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070506429] [2023-08-29 19:51:13,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:51:13,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:51:13,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:13,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:51:13,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:51:13,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 260 [2023-08-29 19:51:13,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 32 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:13,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:13,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 260 [2023-08-29 19:51:13,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:13,959 INFO L130 PetriNetUnfolder]: 121/305 cut-off events. [2023-08-29 19:51:13,960 INFO L131 PetriNetUnfolder]: For 192/198 co-relation queries the response was YES. [2023-08-29 19:51:13,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 822 conditions, 305 events. 121/305 cut-off events. For 192/198 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1460 event pairs, 79 based on Foata normal form. 14/314 useless extension candidates. Maximal degree in co-relation 808. Up to 168 conditions per place. [2023-08-29 19:51:13,962 INFO L137 encePairwiseOnDemand]: 257/260 looper letters, 26 selfloop transitions, 3 changer transitions 2/45 dead transitions. [2023-08-29 19:51:13,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 45 transitions, 263 flow [2023-08-29 19:51:13,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:51:13,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:51:13,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 468 transitions. [2023-08-29 19:51:13,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2023-08-29 19:51:13,964 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 468 transitions. [2023-08-29 19:51:13,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 468 transitions. [2023-08-29 19:51:13,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:13,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 468 transitions. [2023-08-29 19:51:13,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:13,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:13,968 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:13,968 INFO L175 Difference]: Start difference. First operand has 55 places, 32 transitions, 153 flow. Second operand 4 states and 468 transitions. [2023-08-29 19:51:13,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 45 transitions, 263 flow [2023-08-29 19:51:13,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 45 transitions, 240 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-29 19:51:13,971 INFO L231 Difference]: Finished difference. Result has 52 places, 31 transitions, 132 flow [2023-08-29 19:51:13,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=52, PETRI_TRANSITIONS=31} [2023-08-29 19:51:13,972 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2023-08-29 19:51:13,972 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 31 transitions, 132 flow [2023-08-29 19:51:13,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:13,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:13,972 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:13,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-29 19:51:14,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-08-29 19:51:14,182 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-29 19:51:14,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:14,183 INFO L85 PathProgramCache]: Analyzing trace with hash 808245991, now seen corresponding path program 2 times [2023-08-29 19:51:14,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:14,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385778499] [2023-08-29 19:51:14,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:14,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:14,238 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 19:51:14,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:14,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385778499] [2023-08-29 19:51:14,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385778499] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:14,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:14,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 19:51:14,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497084556] [2023-08-29 19:51:14,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:14,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:51:14,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:14,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:51:14,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:51:14,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 260 [2023-08-29 19:51:14,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 31 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:14,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:14,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 260 [2023-08-29 19:51:14,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:14,389 INFO L130 PetriNetUnfolder]: 225/459 cut-off events. [2023-08-29 19:51:14,390 INFO L131 PetriNetUnfolder]: For 226/226 co-relation queries the response was YES. [2023-08-29 19:51:14,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1300 conditions, 459 events. 225/459 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2283 event pairs, 113 based on Foata normal form. 6/458 useless extension candidates. Maximal degree in co-relation 1290. Up to 238 conditions per place. [2023-08-29 19:51:14,392 INFO L137 encePairwiseOnDemand]: 254/260 looper letters, 27 selfloop transitions, 5 changer transitions 11/48 dead transitions. [2023-08-29 19:51:14,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 48 transitions, 276 flow [2023-08-29 19:51:14,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 19:51:14,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 19:51:14,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 539 transitions. [2023-08-29 19:51:14,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146153846153846 [2023-08-29 19:51:14,394 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 539 transitions. [2023-08-29 19:51:14,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 539 transitions. [2023-08-29 19:51:14,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:14,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 539 transitions. [2023-08-29 19:51:14,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:14,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:14,398 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:14,398 INFO L175 Difference]: Start difference. First operand has 52 places, 31 transitions, 132 flow. Second operand 5 states and 539 transitions. [2023-08-29 19:51:14,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 48 transitions, 276 flow [2023-08-29 19:51:14,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 48 transitions, 264 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 19:51:14,400 INFO L231 Difference]: Finished difference. Result has 55 places, 31 transitions, 145 flow [2023-08-29 19:51:14,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=55, PETRI_TRANSITIONS=31} [2023-08-29 19:51:14,400 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2023-08-29 19:51:14,401 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 31 transitions, 145 flow [2023-08-29 19:51:14,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:14,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:14,401 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:14,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-29 19:51:14,401 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-29 19:51:14,402 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:14,402 INFO L85 PathProgramCache]: Analyzing trace with hash -2118907775, now seen corresponding path program 3 times [2023-08-29 19:51:14,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:14,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511278323] [2023-08-29 19:51:14,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:14,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:14,447 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 19:51:14,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:14,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511278323] [2023-08-29 19:51:14,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511278323] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:14,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:14,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 19:51:14,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066369383] [2023-08-29 19:51:14,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:14,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:51:14,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:14,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:51:14,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:51:14,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 260 [2023-08-29 19:51:14,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 31 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:14,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:14,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 260 [2023-08-29 19:51:14,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:14,606 INFO L130 PetriNetUnfolder]: 218/454 cut-off events. [2023-08-29 19:51:14,607 INFO L131 PetriNetUnfolder]: For 376/376 co-relation queries the response was YES. [2023-08-29 19:51:14,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1326 conditions, 454 events. 218/454 cut-off events. For 376/376 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2261 event pairs, 166 based on Foata normal form. 6/453 useless extension candidates. Maximal degree in co-relation 1314. Up to 345 conditions per place. [2023-08-29 19:51:14,609 INFO L137 encePairwiseOnDemand]: 253/260 looper letters, 29 selfloop transitions, 5 changer transitions 10/49 dead transitions. [2023-08-29 19:51:14,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 49 transitions, 308 flow [2023-08-29 19:51:14,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 19:51:14,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 19:51:14,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2023-08-29 19:51:14,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4153846153846154 [2023-08-29 19:51:14,611 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 540 transitions. [2023-08-29 19:51:14,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 540 transitions. [2023-08-29 19:51:14,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:14,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 540 transitions. [2023-08-29 19:51:14,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:14,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:14,614 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:14,614 INFO L175 Difference]: Start difference. First operand has 55 places, 31 transitions, 145 flow. Second operand 5 states and 540 transitions. [2023-08-29 19:51:14,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 49 transitions, 308 flow [2023-08-29 19:51:14,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 49 transitions, 297 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-29 19:51:14,616 INFO L231 Difference]: Finished difference. Result has 59 places, 31 transitions, 158 flow [2023-08-29 19:51:14,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=59, PETRI_TRANSITIONS=31} [2023-08-29 19:51:14,616 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 23 predicate places. [2023-08-29 19:51:14,617 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 31 transitions, 158 flow [2023-08-29 19:51:14,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:14,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:14,617 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:14,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-29 19:51:14,617 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-29 19:51:14,617 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:14,617 INFO L85 PathProgramCache]: Analyzing trace with hash -467925395, now seen corresponding path program 1 times [2023-08-29 19:51:14,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:14,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179092258] [2023-08-29 19:51:14,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:14,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:14,671 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 19:51:14,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:14,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179092258] [2023-08-29 19:51:14,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179092258] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:14,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:14,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:51:14,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208650049] [2023-08-29 19:51:14,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:14,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:51:14,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:14,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:51:14,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:51:14,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 260 [2023-08-29 19:51:14,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 31 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:14,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:14,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 260 [2023-08-29 19:51:14,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:14,708 INFO L130 PetriNetUnfolder]: 61/153 cut-off events. [2023-08-29 19:51:14,708 INFO L131 PetriNetUnfolder]: For 92/92 co-relation queries the response was YES. [2023-08-29 19:51:14,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 153 events. 61/153 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 646 event pairs, 39 based on Foata normal form. 4/151 useless extension candidates. Maximal degree in co-relation 410. Up to 82 conditions per place. [2023-08-29 19:51:14,709 INFO L137 encePairwiseOnDemand]: 258/260 looper letters, 0 selfloop transitions, 0 changer transitions 25/25 dead transitions. [2023-08-29 19:51:14,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 25 transitions, 135 flow [2023-08-29 19:51:14,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:51:14,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:51:14,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2023-08-29 19:51:14,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46923076923076923 [2023-08-29 19:51:14,710 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2023-08-29 19:51:14,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2023-08-29 19:51:14,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:14,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2023-08-29 19:51:14,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:14,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:14,712 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:14,712 INFO L175 Difference]: Start difference. First operand has 59 places, 31 transitions, 158 flow. Second operand 3 states and 366 transitions. [2023-08-29 19:51:14,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 25 transitions, 135 flow [2023-08-29 19:51:14,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 25 transitions, 130 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-29 19:51:14,713 INFO L231 Difference]: Finished difference. Result has 38 places, 0 transitions, 0 flow [2023-08-29 19:51:14,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=38, PETRI_TRANSITIONS=0} [2023-08-29 19:51:14,714 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2023-08-29 19:51:14,714 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 0 transitions, 0 flow [2023-08-29 19:51:14,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:14,714 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 12 remaining) [2023-08-29 19:51:14,714 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2023-08-29 19:51:14,714 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-08-29 19:51:14,714 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-08-29 19:51:14,714 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (7 of 12 remaining) [2023-08-29 19:51:14,715 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-08-29 19:51:14,715 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-08-29 19:51:14,715 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-08-29 19:51:14,715 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (3 of 12 remaining) [2023-08-29 19:51:14,715 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (2 of 12 remaining) [2023-08-29 19:51:14,715 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 12 remaining) [2023-08-29 19:51:14,715 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (0 of 12 remaining) [2023-08-29 19:51:14,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-29 19:51:14,715 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:14,716 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-29 19:51:14,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 133 transitions, 278 flow [2023-08-29 19:51:14,728 INFO L130 PetriNetUnfolder]: 17/165 cut-off events. [2023-08-29 19:51:14,728 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 19:51:14,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 165 events. 17/165 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 364 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 109. Up to 6 conditions per place. [2023-08-29 19:51:14,729 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 133 transitions, 278 flow [2023-08-29 19:51:14,730 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 133 transitions, 278 flow [2023-08-29 19:51:14,730 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 19:51:14,730 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 133 transitions, 278 flow [2023-08-29 19:51:14,730 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 133 transitions, 278 flow [2023-08-29 19:51:14,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 133 transitions, 278 flow [2023-08-29 19:51:14,739 INFO L130 PetriNetUnfolder]: 17/165 cut-off events. [2023-08-29 19:51:14,739 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 19:51:14,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 165 events. 17/165 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 364 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 109. Up to 6 conditions per place. [2023-08-29 19:51:14,743 INFO L119 LiptonReduction]: Number of co-enabled transitions 7636 [2023-08-29 19:51:17,495 INFO L134 LiptonReduction]: Checked pairs total: 11725 [2023-08-29 19:51:17,495 INFO L136 LiptonReduction]: Total number of compositions: 128 [2023-08-29 19:51:17,496 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-29 19:51:17,496 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4bf4d96b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 19:51:17,497 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-29 19:51:17,500 INFO L130 PetriNetUnfolder]: 6/47 cut-off events. [2023-08-29 19:51:17,501 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 19:51:17,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:17,501 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-29 19:51:17,501 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 19:51:17,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:17,501 INFO L85 PathProgramCache]: Analyzing trace with hash -873684011, now seen corresponding path program 1 times [2023-08-29 19:51:17,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:17,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135506905] [2023-08-29 19:51:17,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:17,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 19:51:17,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 19:51:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 19:51:17,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 19:51:17,521 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 19:51:17,521 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-29 19:51:17,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-29 19:51:17,522 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-29 19:51:17,522 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-29 19:51:17,522 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 19:51:17,522 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-08-29 19:51:17,542 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 19:51:17,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 180 transitions, 381 flow [2023-08-29 19:51:17,561 INFO L130 PetriNetUnfolder]: 25/229 cut-off events. [2023-08-29 19:51:17,561 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-08-29 19:51:17,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 229 events. 25/229 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 643 event pairs, 0 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 169. Up to 8 conditions per place. [2023-08-29 19:51:17,562 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 180 transitions, 381 flow [2023-08-29 19:51:17,564 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 180 transitions, 381 flow [2023-08-29 19:51:17,565 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 19:51:17,565 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 180 transitions, 381 flow [2023-08-29 19:51:17,565 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 180 transitions, 381 flow [2023-08-29 19:51:17,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 180 transitions, 381 flow [2023-08-29 19:51:17,582 INFO L130 PetriNetUnfolder]: 25/229 cut-off events. [2023-08-29 19:51:17,582 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-08-29 19:51:17,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 229 events. 25/229 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 643 event pairs, 0 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 169. Up to 8 conditions per place. [2023-08-29 19:51:17,592 INFO L119 LiptonReduction]: Number of co-enabled transitions 17940 [2023-08-29 19:51:20,929 INFO L134 LiptonReduction]: Checked pairs total: 28440 [2023-08-29 19:51:20,930 INFO L136 LiptonReduction]: Total number of compositions: 177 [2023-08-29 19:51:20,931 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 19:51:20,931 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4bf4d96b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 19:51:20,931 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-29 19:51:20,932 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 19:51:20,932 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:51:20,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:20,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 19:51:20,933 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:20,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:20,933 INFO L85 PathProgramCache]: Analyzing trace with hash 42926, now seen corresponding path program 1 times [2023-08-29 19:51:20,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:20,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983777810] [2023-08-29 19:51:20,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:20,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:20,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:51:20,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:20,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983777810] [2023-08-29 19:51:20,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983777810] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:20,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:20,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:51:20,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385470333] [2023-08-29 19:51:20,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:20,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:51:20,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:20,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:51:20,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:51:20,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 357 [2023-08-29 19:51:20,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 54 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:20,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:20,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 357 [2023-08-29 19:51:20,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:21,376 INFO L130 PetriNetUnfolder]: 3231/5255 cut-off events. [2023-08-29 19:51:21,377 INFO L131 PetriNetUnfolder]: For 421/421 co-relation queries the response was YES. [2023-08-29 19:51:21,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9865 conditions, 5255 events. 3231/5255 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 34582 event pairs, 2574 based on Foata normal form. 478/3644 useless extension candidates. Maximal degree in co-relation 1065. Up to 4260 conditions per place. [2023-08-29 19:51:21,411 INFO L137 encePairwiseOnDemand]: 347/357 looper letters, 26 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2023-08-29 19:51:21,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 45 transitions, 165 flow [2023-08-29 19:51:21,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:51:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:51:21,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2023-08-29 19:51:21,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46218487394957986 [2023-08-29 19:51:21,414 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 495 transitions. [2023-08-29 19:51:21,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 495 transitions. [2023-08-29 19:51:21,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:21,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 495 transitions. [2023-08-29 19:51:21,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:21,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:21,417 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:21,417 INFO L175 Difference]: Start difference. First operand has 49 places, 54 transitions, 129 flow. Second operand 3 states and 495 transitions. [2023-08-29 19:51:21,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 45 transitions, 165 flow [2023-08-29 19:51:21,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 45 transitions, 159 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-29 19:51:21,419 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 107 flow [2023-08-29 19:51:21,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2023-08-29 19:51:21,419 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2023-08-29 19:51:21,420 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 107 flow [2023-08-29 19:51:21,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:21,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:21,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 19:51:21,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-29 19:51:21,420 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:21,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:21,422 INFO L85 PathProgramCache]: Analyzing trace with hash 42925, now seen corresponding path program 1 times [2023-08-29 19:51:21,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:21,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370647707] [2023-08-29 19:51:21,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:21,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:21,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:51:21,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:21,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370647707] [2023-08-29 19:51:21,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370647707] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:21,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:21,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:51:21,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082862844] [2023-08-29 19:51:21,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:21,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:51:21,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:21,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:51:21,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:51:21,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 357 [2023-08-29 19:51:21,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:21,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:21,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 357 [2023-08-29 19:51:21,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:21,733 INFO L130 PetriNetUnfolder]: 2040/3436 cut-off events. [2023-08-29 19:51:21,734 INFO L131 PetriNetUnfolder]: For 154/154 co-relation queries the response was YES. [2023-08-29 19:51:21,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6381 conditions, 3436 events. 2040/3436 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 21557 event pairs, 1602 based on Foata normal form. 0/2290 useless extension candidates. Maximal degree in co-relation 6372. Up to 2726 conditions per place. [2023-08-29 19:51:21,753 INFO L137 encePairwiseOnDemand]: 355/357 looper letters, 25 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2023-08-29 19:51:21,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 157 flow [2023-08-29 19:51:21,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:51:21,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:51:21,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2023-08-29 19:51:21,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4481792717086835 [2023-08-29 19:51:21,755 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 480 transitions. [2023-08-29 19:51:21,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 480 transitions. [2023-08-29 19:51:21,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:21,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 480 transitions. [2023-08-29 19:51:21,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:21,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:21,758 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:21,758 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 107 flow. Second operand 3 states and 480 transitions. [2023-08-29 19:51:21,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 44 transitions, 157 flow [2023-08-29 19:51:21,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 44 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:51:21,759 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 106 flow [2023-08-29 19:51:21,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2023-08-29 19:51:21,762 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2023-08-29 19:51:21,763 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 106 flow [2023-08-29 19:51:21,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:21,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:21,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 19:51:21,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-29 19:51:21,763 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:21,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:21,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1279979797, now seen corresponding path program 1 times [2023-08-29 19:51:21,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:21,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316294498] [2023-08-29 19:51:21,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:21,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:21,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:51:21,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:21,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316294498] [2023-08-29 19:51:21,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316294498] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:21,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:21,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:51:21,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715093660] [2023-08-29 19:51:21,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:21,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:51:21,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:21,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:51:21,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:51:21,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 357 [2023-08-29 19:51:21,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:21,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:21,883 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 357 [2023-08-29 19:51:21,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:22,069 INFO L130 PetriNetUnfolder]: 1323/2287 cut-off events. [2023-08-29 19:51:22,070 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2023-08-29 19:51:22,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4208 conditions, 2287 events. 1323/2287 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 13461 event pairs, 995 based on Foata normal form. 0/1672 useless extension candidates. Maximal degree in co-relation 4198. Up to 1755 conditions per place. [2023-08-29 19:51:22,083 INFO L137 encePairwiseOnDemand]: 353/357 looper letters, 22 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-08-29 19:51:22,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 146 flow [2023-08-29 19:51:22,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:51:22,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:51:22,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 461 transitions. [2023-08-29 19:51:22,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4304388422035481 [2023-08-29 19:51:22,086 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 461 transitions. [2023-08-29 19:51:22,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 461 transitions. [2023-08-29 19:51:22,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:22,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 461 transitions. [2023-08-29 19:51:22,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:22,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:22,089 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:22,089 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 106 flow. Second operand 3 states and 461 transitions. [2023-08-29 19:51:22,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 146 flow [2023-08-29 19:51:22,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 145 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:51:22,090 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 101 flow [2023-08-29 19:51:22,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2023-08-29 19:51:22,092 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2023-08-29 19:51:22,093 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 101 flow [2023-08-29 19:51:22,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:22,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:22,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 19:51:22,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-08-29 19:51:22,093 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:22,094 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:22,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1279979795, now seen corresponding path program 1 times [2023-08-29 19:51:22,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:22,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595109381] [2023-08-29 19:51:22,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:22,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:22,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:51:22,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:22,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595109381] [2023-08-29 19:51:22,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595109381] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:22,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:22,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:51:22,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495990941] [2023-08-29 19:51:22,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:22,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:51:22,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:22,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:51:22,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:51:22,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 357 [2023-08-29 19:51:22,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:22,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:22,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 357 [2023-08-29 19:51:22,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:22,579 INFO L130 PetriNetUnfolder]: 2231/3875 cut-off events. [2023-08-29 19:51:22,579 INFO L131 PetriNetUnfolder]: For 198/198 co-relation queries the response was YES. [2023-08-29 19:51:22,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7049 conditions, 3875 events. 2231/3875 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 26168 event pairs, 995 based on Foata normal form. 0/2868 useless extension candidates. Maximal degree in co-relation 7038. Up to 1755 conditions per place. [2023-08-29 19:51:22,604 INFO L137 encePairwiseOnDemand]: 353/357 looper letters, 39 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2023-08-29 19:51:22,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 233 flow [2023-08-29 19:51:22,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:51:22,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:51:22,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 639 transitions. [2023-08-29 19:51:22,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4474789915966387 [2023-08-29 19:51:22,607 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 639 transitions. [2023-08-29 19:51:22,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 639 transitions. [2023-08-29 19:51:22,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:22,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 639 transitions. [2023-08-29 19:51:22,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 159.75) internal successors, (639), 4 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:22,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 357.0) internal successors, (1785), 5 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:22,616 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 357.0) internal successors, (1785), 5 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:22,616 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 101 flow. Second operand 4 states and 639 transitions. [2023-08-29 19:51:22,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 233 flow [2023-08-29 19:51:22,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:51:22,618 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 114 flow [2023-08-29 19:51:22,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2023-08-29 19:51:22,618 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2023-08-29 19:51:22,618 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 114 flow [2023-08-29 19:51:22,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:22,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:22,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-29 19:51:22,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-08-29 19:51:22,619 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:22,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:22,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1024673152, now seen corresponding path program 1 times [2023-08-29 19:51:22,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:22,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246332941] [2023-08-29 19:51:22,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:22,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:22,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:51:22,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:22,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246332941] [2023-08-29 19:51:22,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246332941] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:51:22,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832842931] [2023-08-29 19:51:22,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:22,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:22,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:51:22,813 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) [2023-08-29 19:51:22,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-29 19:51:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:22,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-29 19:51:22,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:51:22,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:51:22,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:51:22,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:51:22,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:51:23,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:51:23,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832842931] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:51:23,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:51:23,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2023-08-29 19:51:23,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225136426] [2023-08-29 19:51:23,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:51:23,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-29 19:51:23,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:23,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-29 19:51:23,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-08-29 19:51:23,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 357 [2023-08-29 19:51:23,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 114 flow. Second operand has 12 states, 12 states have (on average 147.5) internal successors, (1770), 12 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:23,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:23,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 357 [2023-08-29 19:51:23,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:23,949 INFO L130 PetriNetUnfolder]: 3097/5300 cut-off events. [2023-08-29 19:51:23,950 INFO L131 PetriNetUnfolder]: For 660/660 co-relation queries the response was YES. [2023-08-29 19:51:23,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10239 conditions, 5300 events. 3097/5300 cut-off events. For 660/660 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 37762 event pairs, 851 based on Foata normal form. 0/4241 useless extension candidates. Maximal degree in co-relation 10226. Up to 1463 conditions per place. [2023-08-29 19:51:23,984 INFO L137 encePairwiseOnDemand]: 353/357 looper letters, 71 selfloop transitions, 5 changer transitions 0/94 dead transitions. [2023-08-29 19:51:23,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 94 transitions, 402 flow [2023-08-29 19:51:23,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:51:23,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:51:23,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 953 transitions. [2023-08-29 19:51:23,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4449112978524743 [2023-08-29 19:51:23,991 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 953 transitions. [2023-08-29 19:51:23,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 953 transitions. [2023-08-29 19:51:23,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:23,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 953 transitions. [2023-08-29 19:51:23,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 158.83333333333334) internal successors, (953), 6 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:23,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:23,995 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:23,995 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 114 flow. Second operand 6 states and 953 transitions. [2023-08-29 19:51:23,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 94 transitions, 402 flow [2023-08-29 19:51:23,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 94 transitions, 398 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:51:23,997 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 128 flow [2023-08-29 19:51:23,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=128, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2023-08-29 19:51:23,998 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2023-08-29 19:51:23,998 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 128 flow [2023-08-29 19:51:23,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 147.5) internal successors, (1770), 12 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:23,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:23,999 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-29 19:51:24,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-29 19:51:24,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-08-29 19:51:24,204 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:24,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:24,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1700101811, now seen corresponding path program 2 times [2023-08-29 19:51:24,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:24,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348906632] [2023-08-29 19:51:24,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:24,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:24,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:51:24,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:24,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348906632] [2023-08-29 19:51:24,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348906632] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:51:24,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864405982] [2023-08-29 19:51:24,246 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 19:51:24,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:24,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:51:24,247 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) [2023-08-29 19:51:24,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-29 19:51:24,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 19:51:24,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:51:24,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 19:51:24,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:51:24,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:51:24,326 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:51:24,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864405982] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:24,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 19:51:24,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-29 19:51:24,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223213002] [2023-08-29 19:51:24,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:24,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:51:24,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:24,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:51:24,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:51:24,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 357 [2023-08-29 19:51:24,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 151.4) internal successors, (757), 5 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:24,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:24,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 357 [2023-08-29 19:51:24,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:24,681 INFO L130 PetriNetUnfolder]: 2865/5092 cut-off events. [2023-08-29 19:51:24,681 INFO L131 PetriNetUnfolder]: For 525/525 co-relation queries the response was YES. [2023-08-29 19:51:24,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9699 conditions, 5092 events. 2865/5092 cut-off events. For 525/525 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 38329 event pairs, 95 based on Foata normal form. 172/4309 useless extension candidates. Maximal degree in co-relation 9685. Up to 2920 conditions per place. [2023-08-29 19:51:24,709 INFO L137 encePairwiseOnDemand]: 353/357 looper letters, 65 selfloop transitions, 5 changer transitions 0/88 dead transitions. [2023-08-29 19:51:24,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 88 transitions, 380 flow [2023-08-29 19:51:24,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 19:51:24,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 19:51:24,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 822 transitions. [2023-08-29 19:51:24,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46050420168067224 [2023-08-29 19:51:24,712 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 822 transitions. [2023-08-29 19:51:24,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 822 transitions. [2023-08-29 19:51:24,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:24,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 822 transitions. [2023-08-29 19:51:24,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 164.4) internal successors, (822), 5 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:24,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 357.0) internal successors, (2142), 6 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:24,718 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 357.0) internal successors, (2142), 6 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:24,718 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 128 flow. Second operand 5 states and 822 transitions. [2023-08-29 19:51:24,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 88 transitions, 380 flow [2023-08-29 19:51:24,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 88 transitions, 368 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-08-29 19:51:24,723 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 120 flow [2023-08-29 19:51:24,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=120, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2023-08-29 19:51:24,724 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 1 predicate places. [2023-08-29 19:51:24,724 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 120 flow [2023-08-29 19:51:24,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 151.4) internal successors, (757), 5 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:24,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:24,725 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:24,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-29 19:51:24,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-08-29 19:51:24,930 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:24,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:24,930 INFO L85 PathProgramCache]: Analyzing trace with hash -703742516, now seen corresponding path program 1 times [2023-08-29 19:51:24,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:24,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814803158] [2023-08-29 19:51:24,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:24,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:25,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 19:51:25,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:25,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814803158] [2023-08-29 19:51:25,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814803158] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:51:25,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708568080] [2023-08-29 19:51:25,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:25,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:25,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:51:25,040 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) [2023-08-29 19:51:25,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-29 19:51:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:25,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-29 19:51:25,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:51:25,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:51:25,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:51:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 19:51:25,208 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:51:25,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708568080] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:25,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 19:51:25,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-29 19:51:25,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556032044] [2023-08-29 19:51:25,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:25,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:51:25,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:25,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:51:25,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 19:51:25,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 357 [2023-08-29 19:51:25,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 152.5) internal successors, (610), 4 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:25,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:25,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 357 [2023-08-29 19:51:25,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:25,789 INFO L130 PetriNetUnfolder]: 4651/8096 cut-off events. [2023-08-29 19:51:25,789 INFO L131 PetriNetUnfolder]: For 1812/1812 co-relation queries the response was YES. [2023-08-29 19:51:25,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15890 conditions, 8096 events. 4651/8096 cut-off events. For 1812/1812 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 62404 event pairs, 2255 based on Foata normal form. 0/6576 useless extension candidates. Maximal degree in co-relation 15879. Up to 3713 conditions per place. [2023-08-29 19:51:25,836 INFO L137 encePairwiseOnDemand]: 353/357 looper letters, 42 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2023-08-29 19:51:25,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 63 transitions, 271 flow [2023-08-29 19:51:25,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:51:25,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:51:25,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 644 transitions. [2023-08-29 19:51:25,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2023-08-29 19:51:25,838 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 644 transitions. [2023-08-29 19:51:25,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 644 transitions. [2023-08-29 19:51:25,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:25,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 644 transitions. [2023-08-29 19:51:25,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:25,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 357.0) internal successors, (1785), 5 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:25,842 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 357.0) internal successors, (1785), 5 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:25,842 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 120 flow. Second operand 4 states and 644 transitions. [2023-08-29 19:51:25,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 63 transitions, 271 flow [2023-08-29 19:51:25,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 63 transitions, 253 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-29 19:51:25,843 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 125 flow [2023-08-29 19:51:25,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2023-08-29 19:51:25,844 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2023-08-29 19:51:25,844 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 125 flow [2023-08-29 19:51:25,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 152.5) internal successors, (610), 4 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:25,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:25,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:25,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-29 19:51:26,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-08-29 19:51:26,050 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:26,050 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:26,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1632460623, now seen corresponding path program 1 times [2023-08-29 19:51:26,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:26,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759421351] [2023-08-29 19:51:26,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:26,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:26,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:51:26,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:26,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759421351] [2023-08-29 19:51:26,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759421351] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:26,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:26,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:51:26,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492127760] [2023-08-29 19:51:26,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:26,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:51:26,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:26,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:51:26,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:51:26,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 357 [2023-08-29 19:51:26,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:26,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:26,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 357 [2023-08-29 19:51:26,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:26,368 INFO L130 PetriNetUnfolder]: 2537/4257 cut-off events. [2023-08-29 19:51:26,368 INFO L131 PetriNetUnfolder]: For 959/959 co-relation queries the response was YES. [2023-08-29 19:51:26,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8856 conditions, 4257 events. 2537/4257 cut-off events. For 959/959 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 27738 event pairs, 1707 based on Foata normal form. 142/3796 useless extension candidates. Maximal degree in co-relation 8843. Up to 2908 conditions per place. [2023-08-29 19:51:26,389 INFO L137 encePairwiseOnDemand]: 354/357 looper letters, 39 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-08-29 19:51:26,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 255 flow [2023-08-29 19:51:26,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:51:26,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:51:26,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2023-08-29 19:51:26,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45938375350140054 [2023-08-29 19:51:26,391 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 492 transitions. [2023-08-29 19:51:26,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 492 transitions. [2023-08-29 19:51:26,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:26,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 492 transitions. [2023-08-29 19:51:26,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:26,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:26,393 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:26,394 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 125 flow. Second operand 3 states and 492 transitions. [2023-08-29 19:51:26,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 255 flow [2023-08-29 19:51:26,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 59 transitions, 249 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:51:26,395 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 121 flow [2023-08-29 19:51:26,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2023-08-29 19:51:26,396 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2023-08-29 19:51:26,396 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 121 flow [2023-08-29 19:51:26,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:26,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:26,397 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:26,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-08-29 19:51:26,397 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:26,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:26,397 INFO L85 PathProgramCache]: Analyzing trace with hash -341176268, now seen corresponding path program 1 times [2023-08-29 19:51:26,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:26,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325890148] [2023-08-29 19:51:26,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:26,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:26,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 19:51:26,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:26,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325890148] [2023-08-29 19:51:26,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325890148] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:51:26,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64900834] [2023-08-29 19:51:26,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:26,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:26,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:51:26,546 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) [2023-08-29 19:51:26,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-29 19:51:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:26,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-29 19:51:26,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:51:26,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:51:26,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:51:26,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 19:51:26,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:51:26,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 19:51:26,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64900834] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:51:26,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:51:26,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2023-08-29 19:51:26,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520963673] [2023-08-29 19:51:26,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:51:26,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 19:51:26,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:26,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 19:51:26,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-08-29 19:51:27,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 357 [2023-08-29 19:51:27,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 121 flow. Second operand has 11 states, 11 states have (on average 149.9090909090909) internal successors, (1649), 11 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:27,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:27,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 357 [2023-08-29 19:51:27,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:27,692 INFO L130 PetriNetUnfolder]: 3643/6271 cut-off events. [2023-08-29 19:51:27,692 INFO L131 PetriNetUnfolder]: For 1264/1264 co-relation queries the response was YES. [2023-08-29 19:51:27,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12827 conditions, 6271 events. 3643/6271 cut-off events. For 1264/1264 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 45738 event pairs, 1175 based on Foata normal form. 0/5454 useless extension candidates. Maximal degree in co-relation 12815. Up to 2047 conditions per place. [2023-08-29 19:51:27,717 INFO L137 encePairwiseOnDemand]: 353/357 looper letters, 58 selfloop transitions, 4 changer transitions 0/80 dead transitions. [2023-08-29 19:51:27,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 80 transitions, 349 flow [2023-08-29 19:51:27,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 19:51:27,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 19:51:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 797 transitions. [2023-08-29 19:51:27,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44649859943977593 [2023-08-29 19:51:27,719 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 797 transitions. [2023-08-29 19:51:27,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 797 transitions. [2023-08-29 19:51:27,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:27,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 797 transitions. [2023-08-29 19:51:27,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 159.4) internal successors, (797), 5 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:27,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 357.0) internal successors, (2142), 6 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:27,723 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 357.0) internal successors, (2142), 6 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:27,723 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 121 flow. Second operand 5 states and 797 transitions. [2023-08-29 19:51:27,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 80 transitions, 349 flow [2023-08-29 19:51:27,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 80 transitions, 337 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:51:27,726 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 135 flow [2023-08-29 19:51:27,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2023-08-29 19:51:27,726 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2023-08-29 19:51:27,727 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 135 flow [2023-08-29 19:51:27,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 149.9090909090909) internal successors, (1649), 11 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:27,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:27,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:27,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-29 19:51:27,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-08-29 19:51:27,932 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:27,932 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:27,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1405859132, now seen corresponding path program 1 times [2023-08-29 19:51:27,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:27,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890978489] [2023-08-29 19:51:27,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:27,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 19:51:27,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:27,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890978489] [2023-08-29 19:51:27,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890978489] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:27,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:27,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:51:27,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133505139] [2023-08-29 19:51:27,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:27,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:51:27,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:27,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:51:27,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:51:27,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 357 [2023-08-29 19:51:27,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:27,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:27,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 357 [2023-08-29 19:51:27,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:28,683 INFO L130 PetriNetUnfolder]: 7620/12237 cut-off events. [2023-08-29 19:51:28,683 INFO L131 PetriNetUnfolder]: For 3100/3100 co-relation queries the response was YES. [2023-08-29 19:51:28,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25692 conditions, 12237 events. 7620/12237 cut-off events. For 3100/3100 co-relation queries the response was YES. Maximal size of possible extension queue 733. Compared 90246 event pairs, 3942 based on Foata normal form. 0/10514 useless extension candidates. Maximal degree in co-relation 25678. Up to 7581 conditions per place. [2023-08-29 19:51:28,729 INFO L137 encePairwiseOnDemand]: 351/357 looper letters, 48 selfloop transitions, 5 changer transitions 0/65 dead transitions. [2023-08-29 19:51:28,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 65 transitions, 315 flow [2023-08-29 19:51:28,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:51:28,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:51:28,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2023-08-29 19:51:28,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.453781512605042 [2023-08-29 19:51:28,730 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 486 transitions. [2023-08-29 19:51:28,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 486 transitions. [2023-08-29 19:51:28,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:28,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 486 transitions. [2023-08-29 19:51:28,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:28,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:28,733 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:28,733 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 135 flow. Second operand 3 states and 486 transitions. [2023-08-29 19:51:28,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 65 transitions, 315 flow [2023-08-29 19:51:28,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 65 transitions, 301 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-29 19:51:28,737 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 161 flow [2023-08-29 19:51:28,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2023-08-29 19:51:28,737 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2023-08-29 19:51:28,737 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 161 flow [2023-08-29 19:51:28,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:28,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:28,738 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:28,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-08-29 19:51:28,738 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:28,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:28,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1986524468, now seen corresponding path program 2 times [2023-08-29 19:51:28,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:28,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168495296] [2023-08-29 19:51:28,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:28,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:28,775 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 19:51:28,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:28,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168495296] [2023-08-29 19:51:28,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168495296] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:51:28,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823769368] [2023-08-29 19:51:28,776 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 19:51:28,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:28,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:51:28,778 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) [2023-08-29 19:51:28,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-29 19:51:28,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 19:51:28,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:51:28,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 19:51:28,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:51:28,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 19:51:28,866 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:51:28,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823769368] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:28,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 19:51:28,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-29 19:51:28,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061669903] [2023-08-29 19:51:28,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:28,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:51:28,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:28,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:51:28,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:51:28,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 357 [2023-08-29 19:51:28,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 151.6) internal successors, (758), 5 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:28,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:28,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 357 [2023-08-29 19:51:28,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:29,304 INFO L130 PetriNetUnfolder]: 4282/7831 cut-off events. [2023-08-29 19:51:29,305 INFO L131 PetriNetUnfolder]: For 1714/1802 co-relation queries the response was YES. [2023-08-29 19:51:29,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16060 conditions, 7831 events. 4282/7831 cut-off events. For 1714/1802 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 63738 event pairs, 155 based on Foata normal form. 112/7076 useless extension candidates. Maximal degree in co-relation 16046. Up to 4575 conditions per place. [2023-08-29 19:51:29,339 INFO L137 encePairwiseOnDemand]: 353/357 looper letters, 70 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2023-08-29 19:51:29,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 95 transitions, 447 flow [2023-08-29 19:51:29,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 19:51:29,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 19:51:29,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 815 transitions. [2023-08-29 19:51:29,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4565826330532213 [2023-08-29 19:51:29,341 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 815 transitions. [2023-08-29 19:51:29,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 815 transitions. [2023-08-29 19:51:29,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:29,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 815 transitions. [2023-08-29 19:51:29,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 163.0) internal successors, (815), 5 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:29,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 357.0) internal successors, (2142), 6 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:29,345 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 357.0) internal successors, (2142), 6 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:29,345 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 161 flow. Second operand 5 states and 815 transitions. [2023-08-29 19:51:29,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 95 transitions, 447 flow [2023-08-29 19:51:29,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 95 transitions, 427 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 19:51:29,353 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 151 flow [2023-08-29 19:51:29,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2023-08-29 19:51:29,354 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2023-08-29 19:51:29,354 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 151 flow [2023-08-29 19:51:29,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 151.6) internal successors, (758), 5 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:29,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:29,354 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:29,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-29 19:51:29,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:29,559 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:29,559 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:29,559 INFO L85 PathProgramCache]: Analyzing trace with hash -248426489, now seen corresponding path program 1 times [2023-08-29 19:51:29,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:29,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325995811] [2023-08-29 19:51:29,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:29,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:29,728 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 19:51:29,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:29,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325995811] [2023-08-29 19:51:29,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325995811] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:29,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:29,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:51:29,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225955329] [2023-08-29 19:51:29,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:29,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:51:29,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:29,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:51:29,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:51:29,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 357 [2023-08-29 19:51:29,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 151 flow. Second operand has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:29,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:29,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 357 [2023-08-29 19:51:29,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:30,416 INFO L130 PetriNetUnfolder]: 4768/8296 cut-off events. [2023-08-29 19:51:30,416 INFO L131 PetriNetUnfolder]: For 2289/2423 co-relation queries the response was YES. [2023-08-29 19:51:30,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17565 conditions, 8296 events. 4768/8296 cut-off events. For 2289/2423 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 62473 event pairs, 3273 based on Foata normal form. 0/7346 useless extension candidates. Maximal degree in co-relation 17553. Up to 5645 conditions per place. [2023-08-29 19:51:30,452 INFO L137 encePairwiseOnDemand]: 352/357 looper letters, 42 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2023-08-29 19:51:30,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 65 transitions, 302 flow [2023-08-29 19:51:30,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:51:30,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:51:30,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 631 transitions. [2023-08-29 19:51:30,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418767507002801 [2023-08-29 19:51:30,454 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 631 transitions. [2023-08-29 19:51:30,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 631 transitions. [2023-08-29 19:51:30,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:30,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 631 transitions. [2023-08-29 19:51:30,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:30,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 357.0) internal successors, (1785), 5 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:30,457 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 357.0) internal successors, (1785), 5 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:30,457 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 151 flow. Second operand 4 states and 631 transitions. [2023-08-29 19:51:30,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 65 transitions, 302 flow [2023-08-29 19:51:30,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 284 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-29 19:51:30,460 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 158 flow [2023-08-29 19:51:30,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2023-08-29 19:51:30,461 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2023-08-29 19:51:30,461 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 158 flow [2023-08-29 19:51:30,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:30,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:30,462 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:30,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-08-29 19:51:30,462 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:30,462 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:30,462 INFO L85 PathProgramCache]: Analyzing trace with hash 2118744570, now seen corresponding path program 1 times [2023-08-29 19:51:30,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:30,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790944074] [2023-08-29 19:51:30,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:30,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:30,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 19:51:30,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:30,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790944074] [2023-08-29 19:51:30,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790944074] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:30,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:30,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:51:30,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755880328] [2023-08-29 19:51:30,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:30,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:51:30,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:30,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:51:30,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:51:30,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 357 [2023-08-29 19:51:30,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:30,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:30,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 357 [2023-08-29 19:51:30,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:30,796 INFO L130 PetriNetUnfolder]: 2461/4150 cut-off events. [2023-08-29 19:51:30,796 INFO L131 PetriNetUnfolder]: For 1146/1199 co-relation queries the response was YES. [2023-08-29 19:51:30,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9468 conditions, 4150 events. 2461/4150 cut-off events. For 1146/1199 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 26501 event pairs, 1622 based on Foata normal form. 126/3814 useless extension candidates. Maximal degree in co-relation 9454. Up to 2907 conditions per place. [2023-08-29 19:51:30,815 INFO L137 encePairwiseOnDemand]: 354/357 looper letters, 42 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-08-29 19:51:30,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 64 transitions, 302 flow [2023-08-29 19:51:30,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:51:30,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:51:30,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2023-08-29 19:51:30,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4565826330532213 [2023-08-29 19:51:30,817 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 489 transitions. [2023-08-29 19:51:30,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 489 transitions. [2023-08-29 19:51:30,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:30,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 489 transitions. [2023-08-29 19:51:30,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:30,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:30,821 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:30,821 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 158 flow. Second operand 3 states and 489 transitions. [2023-08-29 19:51:30,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 64 transitions, 302 flow [2023-08-29 19:51:30,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 64 transitions, 292 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-29 19:51:30,826 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 152 flow [2023-08-29 19:51:30,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2023-08-29 19:51:30,826 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2023-08-29 19:51:30,827 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 152 flow [2023-08-29 19:51:30,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:30,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:30,827 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:30,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-08-29 19:51:30,828 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:30,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:30,828 INFO L85 PathProgramCache]: Analyzing trace with hash 888719218, now seen corresponding path program 1 times [2023-08-29 19:51:30,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:30,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504677261] [2023-08-29 19:51:30,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:30,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:31,052 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-29 19:51:31,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:31,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504677261] [2023-08-29 19:51:31,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504677261] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:51:31,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117221714] [2023-08-29 19:51:31,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:31,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:31,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:51:31,057 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) [2023-08-29 19:51:31,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-29 19:51:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:31,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-29 19:51:31,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:51:31,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:51:31,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:51:31,294 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 19:51:31,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:51:31,389 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 19:51:31,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117221714] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:51:31,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:51:31,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2023-08-29 19:51:31,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205527563] [2023-08-29 19:51:31,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:51:31,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-29 19:51:31,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:31,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-29 19:51:31,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-08-29 19:51:31,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 357 [2023-08-29 19:51:31,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 152 flow. Second operand has 12 states, 12 states have (on average 146.08333333333334) internal successors, (1753), 12 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:31,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:31,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 357 [2023-08-29 19:51:31,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:32,408 INFO L130 PetriNetUnfolder]: 3862/6744 cut-off events. [2023-08-29 19:51:32,408 INFO L131 PetriNetUnfolder]: For 1632/1717 co-relation queries the response was YES. [2023-08-29 19:51:32,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14915 conditions, 6744 events. 3862/6744 cut-off events. For 1632/1717 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 48845 event pairs, 1647 based on Foata normal form. 0/6032 useless extension candidates. Maximal degree in co-relation 14902. Up to 2941 conditions per place. [2023-08-29 19:51:32,432 INFO L137 encePairwiseOnDemand]: 353/357 looper letters, 59 selfloop transitions, 4 changer transitions 0/83 dead transitions. [2023-08-29 19:51:32,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 83 transitions, 390 flow [2023-08-29 19:51:32,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 19:51:32,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 19:51:32,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 769 transitions. [2023-08-29 19:51:32,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.430812324929972 [2023-08-29 19:51:32,434 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 769 transitions. [2023-08-29 19:51:32,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 769 transitions. [2023-08-29 19:51:32,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:32,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 769 transitions. [2023-08-29 19:51:32,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 153.8) internal successors, (769), 5 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:32,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 357.0) internal successors, (2142), 6 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:32,436 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 357.0) internal successors, (2142), 6 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:32,436 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 152 flow. Second operand 5 states and 769 transitions. [2023-08-29 19:51:32,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 83 transitions, 390 flow [2023-08-29 19:51:32,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 83 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:51:32,439 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 166 flow [2023-08-29 19:51:32,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2023-08-29 19:51:32,440 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2023-08-29 19:51:32,440 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 166 flow [2023-08-29 19:51:32,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 146.08333333333334) internal successors, (1753), 12 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:32,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:32,440 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:32,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-29 19:51:32,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:32,641 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:32,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:32,641 INFO L85 PathProgramCache]: Analyzing trace with hash -282699678, now seen corresponding path program 1 times [2023-08-29 19:51:32,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:32,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219170572] [2023-08-29 19:51:32,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:32,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:32,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-29 19:51:32,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:32,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219170572] [2023-08-29 19:51:32,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219170572] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:32,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:32,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:51:32,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48139270] [2023-08-29 19:51:32,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:32,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:51:32,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:32,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:51:32,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:51:32,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 357 [2023-08-29 19:51:32,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:32,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:32,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 357 [2023-08-29 19:51:32,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:33,355 INFO L130 PetriNetUnfolder]: 7504/12138 cut-off events. [2023-08-29 19:51:33,355 INFO L131 PetriNetUnfolder]: For 3852/3932 co-relation queries the response was YES. [2023-08-29 19:51:33,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28237 conditions, 12138 events. 7504/12138 cut-off events. For 3852/3932 co-relation queries the response was YES. Maximal size of possible extension queue 727. Compared 89187 event pairs, 3735 based on Foata normal form. 0/11245 useless extension candidates. Maximal degree in co-relation 28222. Up to 7140 conditions per place. [2023-08-29 19:51:33,400 INFO L137 encePairwiseOnDemand]: 351/357 looper letters, 52 selfloop transitions, 7 changer transitions 0/71 dead transitions. [2023-08-29 19:51:33,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 71 transitions, 372 flow [2023-08-29 19:51:33,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:51:33,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:51:33,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 483 transitions. [2023-08-29 19:51:33,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2023-08-29 19:51:33,402 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 483 transitions. [2023-08-29 19:51:33,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 483 transitions. [2023-08-29 19:51:33,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:33,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 483 transitions. [2023-08-29 19:51:33,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:33,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:33,404 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:33,404 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 166 flow. Second operand 3 states and 483 transitions. [2023-08-29 19:51:33,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 71 transitions, 372 flow [2023-08-29 19:51:33,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 362 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 19:51:33,416 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 212 flow [2023-08-29 19:51:33,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2023-08-29 19:51:33,416 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2023-08-29 19:51:33,416 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 212 flow [2023-08-29 19:51:33,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:33,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:33,417 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:33,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-08-29 19:51:33,417 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:33,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:33,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1780497767, now seen corresponding path program 2 times [2023-08-29 19:51:33,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:33,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564640762] [2023-08-29 19:51:33,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:33,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:33,460 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 19:51:33,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:33,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564640762] [2023-08-29 19:51:33,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564640762] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:51:33,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313728688] [2023-08-29 19:51:33,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 19:51:33,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:33,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:51:33,465 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) [2023-08-29 19:51:33,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-29 19:51:33,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 19:51:33,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:51:33,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 19:51:33,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:51:33,565 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 19:51:33,565 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:51:33,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313728688] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:33,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 19:51:33,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-29 19:51:33,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156971444] [2023-08-29 19:51:33,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:33,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:51:33,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:33,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:51:33,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:51:33,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 357 [2023-08-29 19:51:33,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 151.8) internal successors, (759), 5 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:33,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:33,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 357 [2023-08-29 19:51:33,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:34,086 INFO L130 PetriNetUnfolder]: 4365/7952 cut-off events. [2023-08-29 19:51:34,086 INFO L131 PetriNetUnfolder]: For 2766/3095 co-relation queries the response was YES. [2023-08-29 19:51:34,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18100 conditions, 7952 events. 4365/7952 cut-off events. For 2766/3095 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 62796 event pairs, 484 based on Foata normal form. 143/7651 useless extension candidates. Maximal degree in co-relation 18085. Up to 4315 conditions per place. [2023-08-29 19:51:34,124 INFO L137 encePairwiseOnDemand]: 353/357 looper letters, 75 selfloop transitions, 4 changer transitions 0/102 dead transitions. [2023-08-29 19:51:34,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 102 transitions, 524 flow [2023-08-29 19:51:34,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 19:51:34,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 19:51:34,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 807 transitions. [2023-08-29 19:51:34,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45210084033613446 [2023-08-29 19:51:34,126 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 807 transitions. [2023-08-29 19:51:34,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 807 transitions. [2023-08-29 19:51:34,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:34,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 807 transitions. [2023-08-29 19:51:34,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 161.4) internal successors, (807), 5 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:34,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 357.0) internal successors, (2142), 6 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:34,129 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 357.0) internal successors, (2142), 6 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:34,129 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 212 flow. Second operand 5 states and 807 transitions. [2023-08-29 19:51:34,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 102 transitions, 524 flow [2023-08-29 19:51:34,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 102 transitions, 502 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 19:51:34,140 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 201 flow [2023-08-29 19:51:34,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=201, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2023-08-29 19:51:34,141 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 11 predicate places. [2023-08-29 19:51:34,141 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 201 flow [2023-08-29 19:51:34,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 151.8) internal successors, (759), 5 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:34,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:34,142 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:34,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-29 19:51:34,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2023-08-29 19:51:34,347 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:34,347 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:34,347 INFO L85 PathProgramCache]: Analyzing trace with hash -125056973, now seen corresponding path program 1 times [2023-08-29 19:51:34,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:34,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437982327] [2023-08-29 19:51:34,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:34,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:34,372 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-29 19:51:34,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:34,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437982327] [2023-08-29 19:51:34,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437982327] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:34,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:34,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:51:34,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055030273] [2023-08-29 19:51:34,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:34,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:51:34,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:34,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:51:34,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:51:34,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 357 [2023-08-29 19:51:34,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 201 flow. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:34,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:34,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 357 [2023-08-29 19:51:34,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:35,262 INFO L130 PetriNetUnfolder]: 8989/13409 cut-off events. [2023-08-29 19:51:35,262 INFO L131 PetriNetUnfolder]: For 5795/6030 co-relation queries the response was YES. [2023-08-29 19:51:35,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34240 conditions, 13409 events. 8989/13409 cut-off events. For 5795/6030 co-relation queries the response was YES. Maximal size of possible extension queue 825. Compared 89663 event pairs, 4053 based on Foata normal form. 0/12735 useless extension candidates. Maximal degree in co-relation 34225. Up to 7606 conditions per place. [2023-08-29 19:51:35,324 INFO L137 encePairwiseOnDemand]: 351/357 looper letters, 52 selfloop transitions, 10 changer transitions 0/74 dead transitions. [2023-08-29 19:51:35,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 74 transitions, 405 flow [2023-08-29 19:51:35,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:51:35,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:51:35,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2023-08-29 19:51:35,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4481792717086835 [2023-08-29 19:51:35,326 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 480 transitions. [2023-08-29 19:51:35,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 480 transitions. [2023-08-29 19:51:35,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:35,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 480 transitions. [2023-08-29 19:51:35,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:35,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:35,328 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:35,329 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 201 flow. Second operand 3 states and 480 transitions. [2023-08-29 19:51:35,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 74 transitions, 405 flow [2023-08-29 19:51:35,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 74 transitions, 394 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-29 19:51:35,342 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 268 flow [2023-08-29 19:51:35,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2023-08-29 19:51:35,343 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2023-08-29 19:51:35,343 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 268 flow [2023-08-29 19:51:35,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:35,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:35,344 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:35,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-08-29 19:51:35,344 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:35,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:35,345 INFO L85 PathProgramCache]: Analyzing trace with hash 2099727832, now seen corresponding path program 1 times [2023-08-29 19:51:35,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:35,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420946483] [2023-08-29 19:51:35,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:35,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:35,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 19:51:35,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:35,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420946483] [2023-08-29 19:51:35,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420946483] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:51:35,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741530001] [2023-08-29 19:51:35,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:35,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:35,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:51:35,385 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) [2023-08-29 19:51:35,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-29 19:51:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:35,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 19:51:35,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:51:35,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 19:51:35,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:51:35,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 19:51:35,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741530001] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:51:35,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:51:35,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-29 19:51:35,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949278661] [2023-08-29 19:51:35,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:51:35,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:51:35,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:35,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:51:35,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:51:35,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 357 [2023-08-29 19:51:35,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 268 flow. Second operand has 5 states, 5 states have (on average 152.6) internal successors, (763), 5 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:35,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:35,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 357 [2023-08-29 19:51:35,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:35,926 INFO L130 PetriNetUnfolder]: 3426/5623 cut-off events. [2023-08-29 19:51:35,926 INFO L131 PetriNetUnfolder]: For 3633/3980 co-relation queries the response was YES. [2023-08-29 19:51:35,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14918 conditions, 5623 events. 3426/5623 cut-off events. For 3633/3980 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 38159 event pairs, 1678 based on Foata normal form. 158/5596 useless extension candidates. Maximal degree in co-relation 14902. Up to 3731 conditions per place. [2023-08-29 19:51:35,951 INFO L137 encePairwiseOnDemand]: 354/357 looper letters, 63 selfloop transitions, 3 changer transitions 0/93 dead transitions. [2023-08-29 19:51:35,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 93 transitions, 546 flow [2023-08-29 19:51:35,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:51:35,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:51:35,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 648 transitions. [2023-08-29 19:51:35,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.453781512605042 [2023-08-29 19:51:35,952 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 648 transitions. [2023-08-29 19:51:35,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 648 transitions. [2023-08-29 19:51:35,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:35,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 648 transitions. [2023-08-29 19:51:35,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:35,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 357.0) internal successors, (1785), 5 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:35,954 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 357.0) internal successors, (1785), 5 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:35,954 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 268 flow. Second operand 4 states and 648 transitions. [2023-08-29 19:51:35,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 93 transitions, 546 flow [2023-08-29 19:51:35,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 93 transitions, 522 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:51:35,979 INFO L231 Difference]: Finished difference. Result has 62 places, 55 transitions, 250 flow [2023-08-29 19:51:35,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=250, PETRI_PLACES=62, PETRI_TRANSITIONS=55} [2023-08-29 19:51:35,980 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2023-08-29 19:51:35,980 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 250 flow [2023-08-29 19:51:35,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 152.6) internal successors, (763), 5 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:35,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:35,980 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:35,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-29 19:51:36,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:36,181 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:36,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:36,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1860491489, now seen corresponding path program 2 times [2023-08-29 19:51:36,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:36,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032122508] [2023-08-29 19:51:36,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:36,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-29 19:51:36,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:36,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032122508] [2023-08-29 19:51:36,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032122508] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:51:36,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227671753] [2023-08-29 19:51:36,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 19:51:36,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:36,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:51:36,235 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) [2023-08-29 19:51:36,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-29 19:51:36,324 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 19:51:36,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:51:36,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 19:51:36,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:51:36,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-29 19:51:36,349 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:51:36,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227671753] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:36,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 19:51:36,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2023-08-29 19:51:36,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79057483] [2023-08-29 19:51:36,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:36,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:51:36,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:36,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:51:36,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 19:51:36,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 357 [2023-08-29 19:51:36,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 250 flow. Second operand has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:36,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:36,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 357 [2023-08-29 19:51:36,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:37,161 INFO L130 PetriNetUnfolder]: 6804/10644 cut-off events. [2023-08-29 19:51:37,161 INFO L131 PetriNetUnfolder]: For 7132/7254 co-relation queries the response was YES. [2023-08-29 19:51:37,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29057 conditions, 10644 events. 6804/10644 cut-off events. For 7132/7254 co-relation queries the response was YES. Maximal size of possible extension queue 596. Compared 73169 event pairs, 3025 based on Foata normal form. 42/10302 useless extension candidates. Maximal degree in co-relation 29041. Up to 5300 conditions per place. [2023-08-29 19:51:37,207 INFO L137 encePairwiseOnDemand]: 348/357 looper letters, 92 selfloop transitions, 20 changer transitions 1/122 dead transitions. [2023-08-29 19:51:37,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 122 transitions, 747 flow [2023-08-29 19:51:37,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:51:37,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:51:37,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 920 transitions. [2023-08-29 19:51:37,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4295051353874883 [2023-08-29 19:51:37,208 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 920 transitions. [2023-08-29 19:51:37,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 920 transitions. [2023-08-29 19:51:37,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:37,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 920 transitions. [2023-08-29 19:51:37,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 153.33333333333334) internal successors, (920), 6 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:37,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:37,211 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:37,211 INFO L175 Difference]: Start difference. First operand has 62 places, 55 transitions, 250 flow. Second operand 6 states and 920 transitions. [2023-08-29 19:51:37,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 122 transitions, 747 flow [2023-08-29 19:51:37,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 122 transitions, 741 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 19:51:37,224 INFO L231 Difference]: Finished difference. Result has 68 places, 66 transitions, 396 flow [2023-08-29 19:51:37,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=396, PETRI_PLACES=68, PETRI_TRANSITIONS=66} [2023-08-29 19:51:37,224 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 19 predicate places. [2023-08-29 19:51:37,224 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 396 flow [2023-08-29 19:51:37,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:37,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:37,225 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:37,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-29 19:51:37,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:37,429 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:37,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:37,429 INFO L85 PathProgramCache]: Analyzing trace with hash 218212063, now seen corresponding path program 3 times [2023-08-29 19:51:37,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:37,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158478615] [2023-08-29 19:51:37,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:37,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:37,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-29 19:51:37,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:37,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158478615] [2023-08-29 19:51:37,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158478615] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:51:37,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841088633] [2023-08-29 19:51:37,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 19:51:37,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:37,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:51:37,465 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) [2023-08-29 19:51:37,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-29 19:51:37,573 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 19:51:37,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:51:37,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 19:51:37,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:51:37,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-29 19:51:37,594 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:51:37,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841088633] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:37,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 19:51:37,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2023-08-29 19:51:37,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651605242] [2023-08-29 19:51:37,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:37,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:51:37,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:37,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:51:37,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-29 19:51:37,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 357 [2023-08-29 19:51:37,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 396 flow. Second operand has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:37,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:37,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 357 [2023-08-29 19:51:37,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:38,633 INFO L130 PetriNetUnfolder]: 7862/12593 cut-off events. [2023-08-29 19:51:38,633 INFO L131 PetriNetUnfolder]: For 15822/15944 co-relation queries the response was YES. [2023-08-29 19:51:38,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36777 conditions, 12593 events. 7862/12593 cut-off events. For 15822/15944 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 91575 event pairs, 4966 based on Foata normal form. 92/12604 useless extension candidates. Maximal degree in co-relation 36757. Up to 8987 conditions per place. [2023-08-29 19:51:38,692 INFO L137 encePairwiseOnDemand]: 348/357 looper letters, 102 selfloop transitions, 32 changer transitions 3/146 dead transitions. [2023-08-29 19:51:38,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 146 transitions, 1134 flow [2023-08-29 19:51:38,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:51:38,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:51:38,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 919 transitions. [2023-08-29 19:51:38,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4290382819794584 [2023-08-29 19:51:38,695 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 919 transitions. [2023-08-29 19:51:38,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 919 transitions. [2023-08-29 19:51:38,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:38,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 919 transitions. [2023-08-29 19:51:38,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 153.16666666666666) internal successors, (919), 6 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:38,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:38,697 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:38,698 INFO L175 Difference]: Start difference. First operand has 68 places, 66 transitions, 396 flow. Second operand 6 states and 919 transitions. [2023-08-29 19:51:38,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 146 transitions, 1134 flow [2023-08-29 19:51:38,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 146 transitions, 1134 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 19:51:38,776 INFO L231 Difference]: Finished difference. Result has 77 places, 92 transitions, 805 flow [2023-08-29 19:51:38,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=805, PETRI_PLACES=77, PETRI_TRANSITIONS=92} [2023-08-29 19:51:38,776 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 28 predicate places. [2023-08-29 19:51:38,777 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 92 transitions, 805 flow [2023-08-29 19:51:38,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:38,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:38,777 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:38,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-29 19:51:38,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:38,982 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:38,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:38,982 INFO L85 PathProgramCache]: Analyzing trace with hash 710195769, now seen corresponding path program 1 times [2023-08-29 19:51:38,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:38,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887999653] [2023-08-29 19:51:38,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:38,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:39,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-29 19:51:39,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:39,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887999653] [2023-08-29 19:51:39,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887999653] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:51:39,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983820293] [2023-08-29 19:51:39,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:39,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:39,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:51:39,018 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 19:51:39,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-29 19:51:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:39,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 19:51:39,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:51:39,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-29 19:51:39,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:51:39,148 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-29 19:51:39,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983820293] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:51:39,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:51:39,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-29 19:51:39,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752297384] [2023-08-29 19:51:39,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:51:39,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:51:39,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:39,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:51:39,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:51:39,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 357 [2023-08-29 19:51:39,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 92 transitions, 805 flow. Second operand has 5 states, 5 states have (on average 152.6) internal successors, (763), 5 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:39,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:39,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 357 [2023-08-29 19:51:39,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:39,814 INFO L130 PetriNetUnfolder]: 4769/8351 cut-off events. [2023-08-29 19:51:39,814 INFO L131 PetriNetUnfolder]: For 15259/16799 co-relation queries the response was YES. [2023-08-29 19:51:39,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24968 conditions, 8351 events. 4769/8351 cut-off events. For 15259/16799 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 65573 event pairs, 3217 based on Foata normal form. 286/8305 useless extension candidates. Maximal degree in co-relation 24943. Up to 5908 conditions per place. [2023-08-29 19:51:39,853 INFO L137 encePairwiseOnDemand]: 354/357 looper letters, 64 selfloop transitions, 3 changer transitions 0/125 dead transitions. [2023-08-29 19:51:39,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 125 transitions, 1073 flow [2023-08-29 19:51:39,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:51:39,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:51:39,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions. [2023-08-29 19:51:39,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2023-08-29 19:51:39,854 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 646 transitions. [2023-08-29 19:51:39,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 646 transitions. [2023-08-29 19:51:39,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:39,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 646 transitions. [2023-08-29 19:51:39,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 161.5) internal successors, (646), 4 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:39,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 357.0) internal successors, (1785), 5 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:39,856 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 357.0) internal successors, (1785), 5 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:39,856 INFO L175 Difference]: Start difference. First operand has 77 places, 92 transitions, 805 flow. Second operand 4 states and 646 transitions. [2023-08-29 19:51:39,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 125 transitions, 1073 flow [2023-08-29 19:51:39,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 125 transitions, 1053 flow, removed 10 selfloop flow, removed 0 redundant places. [2023-08-29 19:51:39,930 INFO L231 Difference]: Finished difference. Result has 80 places, 91 transitions, 787 flow [2023-08-29 19:51:39,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=787, PETRI_PLACES=80, PETRI_TRANSITIONS=91} [2023-08-29 19:51:39,931 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 31 predicate places. [2023-08-29 19:51:39,931 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 91 transitions, 787 flow [2023-08-29 19:51:39,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 152.6) internal successors, (763), 5 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:39,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:39,931 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:39,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-08-29 19:51:40,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2023-08-29 19:51:40,132 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:40,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:40,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1309774281, now seen corresponding path program 2 times [2023-08-29 19:51:40,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:40,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557069159] [2023-08-29 19:51:40,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:40,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:40,172 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 19:51:40,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:40,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557069159] [2023-08-29 19:51:40,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557069159] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:40,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:40,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 19:51:40,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413976115] [2023-08-29 19:51:40,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:40,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:51:40,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:40,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:51:40,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:51:40,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 357 [2023-08-29 19:51:40,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 91 transitions, 787 flow. Second operand has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:40,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:40,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 357 [2023-08-29 19:51:40,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:41,387 INFO L130 PetriNetUnfolder]: 8543/13837 cut-off events. [2023-08-29 19:51:41,387 INFO L131 PetriNetUnfolder]: For 31164/31336 co-relation queries the response was YES. [2023-08-29 19:51:41,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44766 conditions, 13837 events. 8543/13837 cut-off events. For 31164/31336 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 104440 event pairs, 3795 based on Foata normal form. 116/13869 useless extension candidates. Maximal degree in co-relation 44740. Up to 6516 conditions per place. [2023-08-29 19:51:41,455 INFO L137 encePairwiseOnDemand]: 348/357 looper letters, 107 selfloop transitions, 40 changer transitions 2/158 dead transitions. [2023-08-29 19:51:41,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 158 transitions, 1456 flow [2023-08-29 19:51:41,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:51:41,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:51:41,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 919 transitions. [2023-08-29 19:51:41,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4290382819794584 [2023-08-29 19:51:41,456 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 919 transitions. [2023-08-29 19:51:41,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 919 transitions. [2023-08-29 19:51:41,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:41,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 919 transitions. [2023-08-29 19:51:41,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 153.16666666666666) internal successors, (919), 6 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:41,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:41,459 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:41,459 INFO L175 Difference]: Start difference. First operand has 80 places, 91 transitions, 787 flow. Second operand 6 states and 919 transitions. [2023-08-29 19:51:41,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 158 transitions, 1456 flow [2023-08-29 19:51:41,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 158 transitions, 1450 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 19:51:41,707 INFO L231 Difference]: Finished difference. Result has 86 places, 103 transitions, 1064 flow [2023-08-29 19:51:41,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1064, PETRI_PLACES=86, PETRI_TRANSITIONS=103} [2023-08-29 19:51:41,707 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 37 predicate places. [2023-08-29 19:51:41,707 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 103 transitions, 1064 flow [2023-08-29 19:51:41,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:41,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:41,708 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:41,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2023-08-29 19:51:41,708 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:41,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:41,709 INFO L85 PathProgramCache]: Analyzing trace with hash 69855567, now seen corresponding path program 3 times [2023-08-29 19:51:41,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:41,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857525418] [2023-08-29 19:51:41,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:41,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:41,757 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 19:51:41,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:41,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857525418] [2023-08-29 19:51:41,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857525418] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:41,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:41,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 19:51:41,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245332927] [2023-08-29 19:51:41,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:41,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:51:41,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:41,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:51:41,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:51:41,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 357 [2023-08-29 19:51:41,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 103 transitions, 1064 flow. Second operand has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:41,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:41,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 357 [2023-08-29 19:51:41,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:43,276 INFO L130 PetriNetUnfolder]: 9604/15722 cut-off events. [2023-08-29 19:51:43,277 INFO L131 PetriNetUnfolder]: For 53604/53812 co-relation queries the response was YES. [2023-08-29 19:51:43,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54114 conditions, 15722 events. 9604/15722 cut-off events. For 53604/53812 co-relation queries the response was YES. Maximal size of possible extension queue 1079. Compared 123494 event pairs, 6464 based on Foata normal form. 94/15695 useless extension candidates. Maximal degree in co-relation 54084. Up to 11815 conditions per place. [2023-08-29 19:51:43,350 INFO L137 encePairwiseOnDemand]: 348/357 looper letters, 136 selfloop transitions, 40 changer transitions 3/188 dead transitions. [2023-08-29 19:51:43,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 188 transitions, 2102 flow [2023-08-29 19:51:43,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:51:43,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:51:43,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 920 transitions. [2023-08-29 19:51:43,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4295051353874883 [2023-08-29 19:51:43,351 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 920 transitions. [2023-08-29 19:51:43,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 920 transitions. [2023-08-29 19:51:43,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:43,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 920 transitions. [2023-08-29 19:51:43,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 153.33333333333334) internal successors, (920), 6 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:43,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:43,353 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:43,353 INFO L175 Difference]: Start difference. First operand has 86 places, 103 transitions, 1064 flow. Second operand 6 states and 920 transitions. [2023-08-29 19:51:43,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 188 transitions, 2102 flow [2023-08-29 19:51:43,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 188 transitions, 2078 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-08-29 19:51:43,773 INFO L231 Difference]: Finished difference. Result has 95 places, 133 transitions, 1642 flow [2023-08-29 19:51:43,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1642, PETRI_PLACES=95, PETRI_TRANSITIONS=133} [2023-08-29 19:51:43,773 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 46 predicate places. [2023-08-29 19:51:43,773 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 133 transitions, 1642 flow [2023-08-29 19:51:43,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:43,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:43,774 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:43,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2023-08-29 19:51:43,774 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:43,774 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:43,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1457791846, now seen corresponding path program 1 times [2023-08-29 19:51:43,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:43,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038985757] [2023-08-29 19:51:43,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:43,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:43,823 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 19:51:43,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:43,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038985757] [2023-08-29 19:51:43,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038985757] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:43,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:43,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:51:43,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094007117] [2023-08-29 19:51:43,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:43,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:51:43,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:43,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:51:43,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:51:43,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 357 [2023-08-29 19:51:43,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 133 transitions, 1642 flow. Second operand has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:43,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:43,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 357 [2023-08-29 19:51:43,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:44,442 INFO L130 PetriNetUnfolder]: 2893/5643 cut-off events. [2023-08-29 19:51:44,442 INFO L131 PetriNetUnfolder]: For 18711/18961 co-relation queries the response was YES. [2023-08-29 19:51:44,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19096 conditions, 5643 events. 2893/5643 cut-off events. For 18711/18961 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 44123 event pairs, 1611 based on Foata normal form. 128/5728 useless extension candidates. Maximal degree in co-relation 19061. Up to 3126 conditions per place. [2023-08-29 19:51:44,471 INFO L137 encePairwiseOnDemand]: 351/357 looper letters, 62 selfloop transitions, 7 changer transitions 0/118 dead transitions. [2023-08-29 19:51:44,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 118 transitions, 1281 flow [2023-08-29 19:51:44,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:51:44,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:51:44,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions. [2023-08-29 19:51:44,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4696545284780579 [2023-08-29 19:51:44,473 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 503 transitions. [2023-08-29 19:51:44,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 503 transitions. [2023-08-29 19:51:44,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:44,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 503 transitions. [2023-08-29 19:51:44,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:44,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:44,474 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:44,474 INFO L175 Difference]: Start difference. First operand has 95 places, 133 transitions, 1642 flow. Second operand 3 states and 503 transitions. [2023-08-29 19:51:44,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 118 transitions, 1281 flow [2023-08-29 19:51:44,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 118 transitions, 1206 flow, removed 31 selfloop flow, removed 1 redundant places. [2023-08-29 19:51:44,616 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 861 flow [2023-08-29 19:51:44,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=861, PETRI_PLACES=96, PETRI_TRANSITIONS=88} [2023-08-29 19:51:44,617 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 47 predicate places. [2023-08-29 19:51:44,617 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 861 flow [2023-08-29 19:51:44,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:44,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:44,617 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:44,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2023-08-29 19:51:44,617 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:44,617 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:44,617 INFO L85 PathProgramCache]: Analyzing trace with hash 317026634, now seen corresponding path program 1 times [2023-08-29 19:51:44,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:44,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110523462] [2023-08-29 19:51:44,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:44,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:44,653 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-29 19:51:44,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:44,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110523462] [2023-08-29 19:51:44,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110523462] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:51:44,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321558791] [2023-08-29 19:51:44,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:44,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:44,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:51:44,657 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 19:51:44,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-29 19:51:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:44,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 19:51:44,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:51:44,779 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-29 19:51:44,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:51:44,788 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-29 19:51:44,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321558791] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:51:44,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:51:44,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-29 19:51:44,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610928416] [2023-08-29 19:51:44,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:51:44,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:51:44,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:44,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:51:44,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:51:44,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 357 [2023-08-29 19:51:44,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 861 flow. Second operand has 5 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:44,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:44,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 357 [2023-08-29 19:51:44,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:45,330 INFO L130 PetriNetUnfolder]: 2765/5279 cut-off events. [2023-08-29 19:51:45,330 INFO L131 PetriNetUnfolder]: For 16077/16359 co-relation queries the response was YES. [2023-08-29 19:51:45,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17882 conditions, 5279 events. 2765/5279 cut-off events. For 16077/16359 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 40246 event pairs, 1809 based on Foata normal form. 104/5322 useless extension candidates. Maximal degree in co-relation 17847. Up to 3482 conditions per place. [2023-08-29 19:51:45,352 INFO L137 encePairwiseOnDemand]: 354/357 looper letters, 69 selfloop transitions, 3 changer transitions 0/121 dead transitions. [2023-08-29 19:51:45,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 121 transitions, 1152 flow [2023-08-29 19:51:45,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:51:45,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:51:45,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 644 transitions. [2023-08-29 19:51:45,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2023-08-29 19:51:45,354 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 644 transitions. [2023-08-29 19:51:45,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 644 transitions. [2023-08-29 19:51:45,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:45,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 644 transitions. [2023-08-29 19:51:45,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:45,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 357.0) internal successors, (1785), 5 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:45,355 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 357.0) internal successors, (1785), 5 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:45,355 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 861 flow. Second operand 4 states and 644 transitions. [2023-08-29 19:51:45,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 121 transitions, 1152 flow [2023-08-29 19:51:45,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 121 transitions, 1138 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:51:45,424 INFO L231 Difference]: Finished difference. Result has 98 places, 87 transitions, 854 flow [2023-08-29 19:51:45,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=854, PETRI_PLACES=98, PETRI_TRANSITIONS=87} [2023-08-29 19:51:45,424 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 49 predicate places. [2023-08-29 19:51:45,424 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 87 transitions, 854 flow [2023-08-29 19:51:45,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:45,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:45,424 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:45,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-29 19:51:45,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:51:45,625 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:45,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:45,625 INFO L85 PathProgramCache]: Analyzing trace with hash -246014799, now seen corresponding path program 2 times [2023-08-29 19:51:45,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:45,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374596484] [2023-08-29 19:51:45,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:45,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:45,667 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-29 19:51:45,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:45,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374596484] [2023-08-29 19:51:45,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374596484] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:45,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:45,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 19:51:45,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704056339] [2023-08-29 19:51:45,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:45,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:51:45,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:45,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:51:45,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:51:45,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 357 [2023-08-29 19:51:45,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 87 transitions, 854 flow. Second operand has 5 states, 5 states have (on average 142.2) internal successors, (711), 5 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:45,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:45,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 357 [2023-08-29 19:51:45,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:46,380 INFO L130 PetriNetUnfolder]: 4115/7224 cut-off events. [2023-08-29 19:51:46,381 INFO L131 PetriNetUnfolder]: For 21847/21949 co-relation queries the response was YES. [2023-08-29 19:51:46,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24903 conditions, 7224 events. 4115/7224 cut-off events. For 21847/21949 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 54194 event pairs, 2099 based on Foata normal form. 80/7053 useless extension candidates. Maximal degree in co-relation 24867. Up to 3216 conditions per place. [2023-08-29 19:51:46,418 INFO L137 encePairwiseOnDemand]: 348/357 looper letters, 90 selfloop transitions, 32 changer transitions 7/141 dead transitions. [2023-08-29 19:51:46,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 141 transitions, 1430 flow [2023-08-29 19:51:46,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:51:46,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:51:46,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 912 transitions. [2023-08-29 19:51:46,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4257703081232493 [2023-08-29 19:51:46,420 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 912 transitions. [2023-08-29 19:51:46,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 912 transitions. [2023-08-29 19:51:46,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:46,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 912 transitions. [2023-08-29 19:51:46,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 152.0) internal successors, (912), 6 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:46,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:46,422 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:46,423 INFO L175 Difference]: Start difference. First operand has 98 places, 87 transitions, 854 flow. Second operand 6 states and 912 transitions. [2023-08-29 19:51:46,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 141 transitions, 1430 flow [2023-08-29 19:51:46,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 141 transitions, 1406 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-29 19:51:46,528 INFO L231 Difference]: Finished difference. Result has 104 places, 90 transitions, 998 flow [2023-08-29 19:51:46,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=998, PETRI_PLACES=104, PETRI_TRANSITIONS=90} [2023-08-29 19:51:46,528 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 55 predicate places. [2023-08-29 19:51:46,528 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 90 transitions, 998 flow [2023-08-29 19:51:46,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.2) internal successors, (711), 5 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:46,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:46,529 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:46,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2023-08-29 19:51:46,529 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:46,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:46,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1540156275, now seen corresponding path program 1 times [2023-08-29 19:51:46,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:46,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119416665] [2023-08-29 19:51:46,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:46,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:46,581 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-29 19:51:46,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:46,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119416665] [2023-08-29 19:51:46,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119416665] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:46,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:46,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 19:51:46,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177327637] [2023-08-29 19:51:46,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:46,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:51:46,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:46,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:51:46,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:51:46,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 357 [2023-08-29 19:51:46,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 90 transitions, 998 flow. Second operand has 5 states, 5 states have (on average 142.2) internal successors, (711), 5 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:46,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:46,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 357 [2023-08-29 19:51:46,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:47,323 INFO L130 PetriNetUnfolder]: 4175/7439 cut-off events. [2023-08-29 19:51:47,324 INFO L131 PetriNetUnfolder]: For 27703/27775 co-relation queries the response was YES. [2023-08-29 19:51:47,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26445 conditions, 7439 events. 4175/7439 cut-off events. For 27703/27775 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 56719 event pairs, 2562 based on Foata normal form. 96/7454 useless extension candidates. Maximal degree in co-relation 26405. Up to 3955 conditions per place. [2023-08-29 19:51:47,354 INFO L137 encePairwiseOnDemand]: 348/357 looper letters, 85 selfloop transitions, 24 changer transitions 21/142 dead transitions. [2023-08-29 19:51:47,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 142 transitions, 1583 flow [2023-08-29 19:51:47,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:51:47,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:51:47,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 906 transitions. [2023-08-29 19:51:47,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42296918767507 [2023-08-29 19:51:47,356 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 906 transitions. [2023-08-29 19:51:47,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 906 transitions. [2023-08-29 19:51:47,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:47,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 906 transitions. [2023-08-29 19:51:47,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 151.0) internal successors, (906), 6 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:47,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:47,359 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:47,359 INFO L175 Difference]: Start difference. First operand has 104 places, 90 transitions, 998 flow. Second operand 6 states and 906 transitions. [2023-08-29 19:51:47,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 142 transitions, 1583 flow [2023-08-29 19:51:47,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 142 transitions, 1556 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-08-29 19:51:47,491 INFO L231 Difference]: Finished difference. Result has 111 places, 86 transitions, 1007 flow [2023-08-29 19:51:47,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1007, PETRI_PLACES=111, PETRI_TRANSITIONS=86} [2023-08-29 19:51:47,491 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 62 predicate places. [2023-08-29 19:51:47,491 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 86 transitions, 1007 flow [2023-08-29 19:51:47,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.2) internal successors, (711), 5 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:47,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:47,491 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:47,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2023-08-29 19:51:47,492 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:47,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:47,492 INFO L85 PathProgramCache]: Analyzing trace with hash 943717643, now seen corresponding path program 1 times [2023-08-29 19:51:47,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:47,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575579292] [2023-08-29 19:51:47,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:47,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:47,537 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-29 19:51:47,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:47,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575579292] [2023-08-29 19:51:47,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575579292] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:47,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:47,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 19:51:47,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160069961] [2023-08-29 19:51:47,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:47,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:51:47,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:47,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:51:47,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:51:47,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 357 [2023-08-29 19:51:47,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 86 transitions, 1007 flow. Second operand has 5 states, 5 states have (on average 142.2) internal successors, (711), 5 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:47,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:47,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 357 [2023-08-29 19:51:47,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:48,403 INFO L130 PetriNetUnfolder]: 3846/6825 cut-off events. [2023-08-29 19:51:48,403 INFO L131 PetriNetUnfolder]: For 24819/24899 co-relation queries the response was YES. [2023-08-29 19:51:48,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24209 conditions, 6825 events. 3846/6825 cut-off events. For 24819/24899 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 51367 event pairs, 2112 based on Foata normal form. 100/6865 useless extension candidates. Maximal degree in co-relation 24166. Up to 3213 conditions per place. [2023-08-29 19:51:48,438 INFO L137 encePairwiseOnDemand]: 348/357 looper letters, 83 selfloop transitions, 24 changer transitions 16/135 dead transitions. [2023-08-29 19:51:48,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 135 transitions, 1533 flow [2023-08-29 19:51:48,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:51:48,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:51:48,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 907 transitions. [2023-08-29 19:51:48,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4234360410830999 [2023-08-29 19:51:48,439 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 907 transitions. [2023-08-29 19:51:48,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 907 transitions. [2023-08-29 19:51:48,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:48,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 907 transitions. [2023-08-29 19:51:48,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 151.16666666666666) internal successors, (907), 6 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:48,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:48,442 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:48,442 INFO L175 Difference]: Start difference. First operand has 111 places, 86 transitions, 1007 flow. Second operand 6 states and 907 transitions. [2023-08-29 19:51:48,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 135 transitions, 1533 flow [2023-08-29 19:51:48,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 135 transitions, 1445 flow, removed 15 selfloop flow, removed 6 redundant places. [2023-08-29 19:51:48,601 INFO L231 Difference]: Finished difference. Result has 112 places, 82 transitions, 930 flow [2023-08-29 19:51:48,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=930, PETRI_PLACES=112, PETRI_TRANSITIONS=82} [2023-08-29 19:51:48,601 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 63 predicate places. [2023-08-29 19:51:48,601 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 82 transitions, 930 flow [2023-08-29 19:51:48,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.2) internal successors, (711), 5 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:48,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:48,601 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:48,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2023-08-29 19:51:48,602 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:48,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:48,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1127442587, now seen corresponding path program 1 times [2023-08-29 19:51:48,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:48,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560047255] [2023-08-29 19:51:48,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:48,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:48,644 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-29 19:51:48,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:48,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560047255] [2023-08-29 19:51:48,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560047255] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:48,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:48,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 19:51:48,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082292159] [2023-08-29 19:51:48,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:48,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:51:48,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:48,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:51:48,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:51:48,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 357 [2023-08-29 19:51:48,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 82 transitions, 930 flow. Second operand has 5 states, 5 states have (on average 142.2) internal successors, (711), 5 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:48,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:48,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 357 [2023-08-29 19:51:48,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:49,408 INFO L130 PetriNetUnfolder]: 3442/6001 cut-off events. [2023-08-29 19:51:49,408 INFO L131 PetriNetUnfolder]: For 20894/20900 co-relation queries the response was YES. [2023-08-29 19:51:49,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21379 conditions, 6001 events. 3442/6001 cut-off events. For 20894/20900 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 42907 event pairs, 2183 based on Foata normal form. 104/6049 useless extension candidates. Maximal degree in co-relation 21339. Up to 3374 conditions per place. [2023-08-29 19:51:49,434 INFO L137 encePairwiseOnDemand]: 348/357 looper letters, 73 selfloop transitions, 16 changer transitions 21/122 dead transitions. [2023-08-29 19:51:49,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 122 transitions, 1336 flow [2023-08-29 19:51:49,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:51:49,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:51:49,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 902 transitions. [2023-08-29 19:51:49,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4211017740429505 [2023-08-29 19:51:49,436 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 902 transitions. [2023-08-29 19:51:49,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 902 transitions. [2023-08-29 19:51:49,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:49,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 902 transitions. [2023-08-29 19:51:49,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 150.33333333333334) internal successors, (902), 6 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:49,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:49,440 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:49,440 INFO L175 Difference]: Start difference. First operand has 112 places, 82 transitions, 930 flow. Second operand 6 states and 902 transitions. [2023-08-29 19:51:49,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 122 transitions, 1336 flow [2023-08-29 19:51:49,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 122 transitions, 1308 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-29 19:51:49,564 INFO L231 Difference]: Finished difference. Result has 116 places, 72 transitions, 774 flow [2023-08-29 19:51:49,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=774, PETRI_PLACES=116, PETRI_TRANSITIONS=72} [2023-08-29 19:51:49,564 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 67 predicate places. [2023-08-29 19:51:49,565 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 72 transitions, 774 flow [2023-08-29 19:51:49,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.2) internal successors, (711), 5 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:49,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:49,565 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:49,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2023-08-29 19:51:49,565 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:49,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:49,566 INFO L85 PathProgramCache]: Analyzing trace with hash 43126793, now seen corresponding path program 1 times [2023-08-29 19:51:49,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:49,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017318108] [2023-08-29 19:51:49,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:49,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:49,642 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-29 19:51:49,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:49,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017318108] [2023-08-29 19:51:49,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017318108] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:49,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:49,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 19:51:49,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482943473] [2023-08-29 19:51:49,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:49,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 19:51:49,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:49,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 19:51:49,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-29 19:51:49,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 357 [2023-08-29 19:51:49,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 72 transitions, 774 flow. Second operand has 7 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:49,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:49,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 357 [2023-08-29 19:51:49,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:50,620 INFO L130 PetriNetUnfolder]: 3268/5552 cut-off events. [2023-08-29 19:51:50,620 INFO L131 PetriNetUnfolder]: For 19001/19001 co-relation queries the response was YES. [2023-08-29 19:51:50,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19495 conditions, 5552 events. 3268/5552 cut-off events. For 19001/19001 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 38131 event pairs, 2003 based on Foata normal form. 12/5529 useless extension candidates. Maximal degree in co-relation 19453. Up to 3070 conditions per place. [2023-08-29 19:51:50,648 INFO L137 encePairwiseOnDemand]: 347/357 looper letters, 68 selfloop transitions, 15 changer transitions 24/113 dead transitions. [2023-08-29 19:51:50,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 113 transitions, 1165 flow [2023-08-29 19:51:50,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 19:51:50,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 19:51:50,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1006 transitions. [2023-08-29 19:51:50,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4025610244097639 [2023-08-29 19:51:50,650 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1006 transitions. [2023-08-29 19:51:50,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1006 transitions. [2023-08-29 19:51:50,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:50,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1006 transitions. [2023-08-29 19:51:50,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 143.71428571428572) internal successors, (1006), 7 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:50,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 357.0) internal successors, (2856), 8 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:50,654 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 357.0) internal successors, (2856), 8 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:50,654 INFO L175 Difference]: Start difference. First operand has 116 places, 72 transitions, 774 flow. Second operand 7 states and 1006 transitions. [2023-08-29 19:51:50,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 113 transitions, 1165 flow [2023-08-29 19:51:50,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 113 transitions, 1081 flow, removed 8 selfloop flow, removed 11 redundant places. [2023-08-29 19:51:50,802 INFO L231 Difference]: Finished difference. Result has 112 places, 68 transitions, 663 flow [2023-08-29 19:51:50,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=663, PETRI_PLACES=112, PETRI_TRANSITIONS=68} [2023-08-29 19:51:50,803 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 63 predicate places. [2023-08-29 19:51:50,803 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 68 transitions, 663 flow [2023-08-29 19:51:50,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:50,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:50,803 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:50,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2023-08-29 19:51:50,803 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:50,803 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:50,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1603862851, now seen corresponding path program 1 times [2023-08-29 19:51:50,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:50,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178785353] [2023-08-29 19:51:50,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:50,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:50,876 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-29 19:51:50,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:50,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178785353] [2023-08-29 19:51:50,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178785353] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:50,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:50,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 19:51:50,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660654554] [2023-08-29 19:51:50,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:50,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 19:51:50,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:50,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 19:51:50,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-29 19:51:50,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 357 [2023-08-29 19:51:50,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 68 transitions, 663 flow. Second operand has 7 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:50,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:50,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 357 [2023-08-29 19:51:50,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:51,611 INFO L130 PetriNetUnfolder]: 3124/5248 cut-off events. [2023-08-29 19:51:51,612 INFO L131 PetriNetUnfolder]: For 13373/13373 co-relation queries the response was YES. [2023-08-29 19:51:51,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18224 conditions, 5248 events. 3124/5248 cut-off events. For 13373/13373 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 35272 event pairs, 1848 based on Foata normal form. 12/5225 useless extension candidates. Maximal degree in co-relation 18191. Up to 2807 conditions per place. [2023-08-29 19:51:51,635 INFO L137 encePairwiseOnDemand]: 347/357 looper letters, 64 selfloop transitions, 12 changer transitions 26/107 dead transitions. [2023-08-29 19:51:51,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 107 transitions, 1025 flow [2023-08-29 19:51:51,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 19:51:51,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 19:51:51,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1003 transitions. [2023-08-29 19:51:51,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4013605442176871 [2023-08-29 19:51:51,637 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1003 transitions. [2023-08-29 19:51:51,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1003 transitions. [2023-08-29 19:51:51,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:51,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1003 transitions. [2023-08-29 19:51:51,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 143.28571428571428) internal successors, (1003), 7 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:51,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 357.0) internal successors, (2856), 8 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:51,641 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 357.0) internal successors, (2856), 8 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:51,641 INFO L175 Difference]: Start difference. First operand has 112 places, 68 transitions, 663 flow. Second operand 7 states and 1003 transitions. [2023-08-29 19:51:51,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 107 transitions, 1025 flow [2023-08-29 19:51:51,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 107 transitions, 971 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-08-29 19:51:51,740 INFO L231 Difference]: Finished difference. Result has 109 places, 60 transitions, 543 flow [2023-08-29 19:51:51,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=543, PETRI_PLACES=109, PETRI_TRANSITIONS=60} [2023-08-29 19:51:51,741 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 60 predicate places. [2023-08-29 19:51:51,741 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 60 transitions, 543 flow [2023-08-29 19:51:51,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:51,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:51,742 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:51,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2023-08-29 19:51:51,742 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:51,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:51,742 INFO L85 PathProgramCache]: Analyzing trace with hash 34003829, now seen corresponding path program 1 times [2023-08-29 19:51:51,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:51,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696373267] [2023-08-29 19:51:51,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:51,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:51,811 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-29 19:51:51,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:51,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696373267] [2023-08-29 19:51:51,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696373267] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:51,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:51,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 19:51:51,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977780360] [2023-08-29 19:51:51,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:51,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 19:51:51,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:51,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 19:51:51,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-29 19:51:51,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 357 [2023-08-29 19:51:51,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 60 transitions, 543 flow. Second operand has 7 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:51,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:51,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 357 [2023-08-29 19:51:51,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:52,254 INFO L130 PetriNetUnfolder]: 2057/3517 cut-off events. [2023-08-29 19:51:52,254 INFO L131 PetriNetUnfolder]: For 8160/8160 co-relation queries the response was YES. [2023-08-29 19:51:52,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11854 conditions, 3517 events. 2057/3517 cut-off events. For 8160/8160 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 21850 event pairs, 1233 based on Foata normal form. 12/3498 useless extension candidates. Maximal degree in co-relation 11822. Up to 1884 conditions per place. [2023-08-29 19:51:52,268 INFO L137 encePairwiseOnDemand]: 349/357 looper letters, 57 selfloop transitions, 10 changer transitions 23/95 dead transitions. [2023-08-29 19:51:52,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 95 transitions, 854 flow [2023-08-29 19:51:52,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 19:51:52,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 19:51:52,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 997 transitions. [2023-08-29 19:51:52,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3989595838335334 [2023-08-29 19:51:52,270 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 997 transitions. [2023-08-29 19:51:52,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 997 transitions. [2023-08-29 19:51:52,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:52,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 997 transitions. [2023-08-29 19:51:52,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 142.42857142857142) internal successors, (997), 7 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:52,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 357.0) internal successors, (2856), 8 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:52,274 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 357.0) internal successors, (2856), 8 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:52,274 INFO L175 Difference]: Start difference. First operand has 109 places, 60 transitions, 543 flow. Second operand 7 states and 997 transitions. [2023-08-29 19:51:52,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 95 transitions, 854 flow [2023-08-29 19:51:52,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 95 transitions, 809 flow, removed 3 selfloop flow, removed 8 redundant places. [2023-08-29 19:51:52,309 INFO L231 Difference]: Finished difference. Result has 104 places, 55 transitions, 446 flow [2023-08-29 19:51:52,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=446, PETRI_PLACES=104, PETRI_TRANSITIONS=55} [2023-08-29 19:51:52,309 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 55 predicate places. [2023-08-29 19:51:52,310 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 55 transitions, 446 flow [2023-08-29 19:51:52,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:52,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:52,310 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:52,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2023-08-29 19:51:52,310 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:52,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:52,311 INFO L85 PathProgramCache]: Analyzing trace with hash -461445307, now seen corresponding path program 1 times [2023-08-29 19:51:52,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:52,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542829232] [2023-08-29 19:51:52,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:52,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:52,384 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-29 19:51:52,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:52,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542829232] [2023-08-29 19:51:52,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542829232] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:52,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:52,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 19:51:52,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933985507] [2023-08-29 19:51:52,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:52,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 19:51:52,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:52,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 19:51:52,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-29 19:51:52,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 357 [2023-08-29 19:51:52,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 55 transitions, 446 flow. Second operand has 7 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:52,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:52,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 357 [2023-08-29 19:51:52,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:52,823 INFO L130 PetriNetUnfolder]: 1913/3213 cut-off events. [2023-08-29 19:51:52,823 INFO L131 PetriNetUnfolder]: For 6584/6584 co-relation queries the response was YES. [2023-08-29 19:51:52,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10573 conditions, 3213 events. 1913/3213 cut-off events. For 6584/6584 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 19097 event pairs, 1114 based on Foata normal form. 12/3194 useless extension candidates. Maximal degree in co-relation 10544. Up to 1731 conditions per place. [2023-08-29 19:51:52,831 INFO L137 encePairwiseOnDemand]: 348/357 looper letters, 44 selfloop transitions, 7 changer transitions 33/88 dead transitions. [2023-08-29 19:51:52,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 88 transitions, 734 flow [2023-08-29 19:51:52,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 19:51:52,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 19:51:52,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 993 transitions. [2023-08-29 19:51:52,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39735894357743096 [2023-08-29 19:51:52,833 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 993 transitions. [2023-08-29 19:51:52,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 993 transitions. [2023-08-29 19:51:52,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:52,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 993 transitions. [2023-08-29 19:51:52,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 141.85714285714286) internal successors, (993), 7 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:52,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 357.0) internal successors, (2856), 8 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:52,836 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 357.0) internal successors, (2856), 8 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:52,836 INFO L175 Difference]: Start difference. First operand has 104 places, 55 transitions, 446 flow. Second operand 7 states and 993 transitions. [2023-08-29 19:51:52,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 88 transitions, 734 flow [2023-08-29 19:51:52,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 88 transitions, 672 flow, removed 9 selfloop flow, removed 8 redundant places. [2023-08-29 19:51:52,865 INFO L231 Difference]: Finished difference. Result has 97 places, 45 transitions, 310 flow [2023-08-29 19:51:52,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=310, PETRI_PLACES=97, PETRI_TRANSITIONS=45} [2023-08-29 19:51:52,866 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 48 predicate places. [2023-08-29 19:51:52,866 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 45 transitions, 310 flow [2023-08-29 19:51:52,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:52,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:52,866 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:52,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2023-08-29 19:51:52,866 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:52,866 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:52,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1508386071, now seen corresponding path program 1 times [2023-08-29 19:51:52,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:52,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532654960] [2023-08-29 19:51:52,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:52,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:52,931 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-29 19:51:52,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:52,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532654960] [2023-08-29 19:51:52,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532654960] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:52,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:52,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 19:51:52,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406240074] [2023-08-29 19:51:52,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:52,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 19:51:52,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:52,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 19:51:52,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-29 19:51:53,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 357 [2023-08-29 19:51:53,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 45 transitions, 310 flow. Second operand has 7 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:53,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:53,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 357 [2023-08-29 19:51:53,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:53,224 INFO L130 PetriNetUnfolder]: 899/1533 cut-off events. [2023-08-29 19:51:53,224 INFO L131 PetriNetUnfolder]: For 1737/1737 co-relation queries the response was YES. [2023-08-29 19:51:53,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4504 conditions, 1533 events. 899/1533 cut-off events. For 1737/1737 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7826 event pairs, 652 based on Foata normal form. 18/1520 useless extension candidates. Maximal degree in co-relation 4477. Up to 1045 conditions per place. [2023-08-29 19:51:53,229 INFO L137 encePairwiseOnDemand]: 350/357 looper letters, 37 selfloop transitions, 3 changer transitions 24/68 dead transitions. [2023-08-29 19:51:53,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 68 transitions, 498 flow [2023-08-29 19:51:53,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 19:51:53,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 19:51:53,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 978 transitions. [2023-08-29 19:51:53,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39135654261704683 [2023-08-29 19:51:53,231 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 978 transitions. [2023-08-29 19:51:53,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 978 transitions. [2023-08-29 19:51:53,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:53,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 978 transitions. [2023-08-29 19:51:53,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.71428571428572) internal successors, (978), 7 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:53,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 357.0) internal successors, (2856), 8 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:53,233 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 357.0) internal successors, (2856), 8 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:53,233 INFO L175 Difference]: Start difference. First operand has 97 places, 45 transitions, 310 flow. Second operand 7 states and 978 transitions. [2023-08-29 19:51:53,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 68 transitions, 498 flow [2023-08-29 19:51:53,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 68 transitions, 413 flow, removed 9 selfloop flow, removed 16 redundant places. [2023-08-29 19:51:53,243 INFO L231 Difference]: Finished difference. Result has 78 places, 37 transitions, 170 flow [2023-08-29 19:51:53,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=170, PETRI_PLACES=78, PETRI_TRANSITIONS=37} [2023-08-29 19:51:53,244 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 29 predicate places. [2023-08-29 19:51:53,244 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 37 transitions, 170 flow [2023-08-29 19:51:53,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:53,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:53,245 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:51:53,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2023-08-29 19:51:53,245 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-29 19:51:53,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:53,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1750894889, now seen corresponding path program 1 times [2023-08-29 19:51:53,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:53,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833001346] [2023-08-29 19:51:53,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:53,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:51:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-29 19:51:53,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:51:53,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833001346] [2023-08-29 19:51:53,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833001346] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:51:53,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:51:53,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 19:51:53,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940299068] [2023-08-29 19:51:53,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:51:53,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 19:51:53,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:51:53,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 19:51:53,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-29 19:51:53,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 357 [2023-08-29 19:51:53,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 37 transitions, 170 flow. Second operand has 7 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:53,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:51:53,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 357 [2023-08-29 19:51:53,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:51:53,540 INFO L130 PetriNetUnfolder]: 808/1340 cut-off events. [2023-08-29 19:51:53,540 INFO L131 PetriNetUnfolder]: For 535/535 co-relation queries the response was YES. [2023-08-29 19:51:53,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3558 conditions, 1340 events. 808/1340 cut-off events. For 535/535 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 6621 event pairs, 571 based on Foata normal form. 18/1327 useless extension candidates. Maximal degree in co-relation 3541. Up to 882 conditions per place. [2023-08-29 19:51:53,543 INFO L137 encePairwiseOnDemand]: 350/357 looper letters, 0 selfloop transitions, 0 changer transitions 55/55 dead transitions. [2023-08-29 19:51:53,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 55 transitions, 319 flow [2023-08-29 19:51:53,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 19:51:53,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 19:51:53,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 969 transitions. [2023-08-29 19:51:53,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3877551020408163 [2023-08-29 19:51:53,544 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 969 transitions. [2023-08-29 19:51:53,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 969 transitions. [2023-08-29 19:51:53,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:51:53,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 969 transitions. [2023-08-29 19:51:53,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 138.42857142857142) internal successors, (969), 7 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:53,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 357.0) internal successors, (2856), 8 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:53,546 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 357.0) internal successors, (2856), 8 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:53,546 INFO L175 Difference]: Start difference. First operand has 78 places, 37 transitions, 170 flow. Second operand 7 states and 969 transitions. [2023-08-29 19:51:53,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 55 transitions, 319 flow [2023-08-29 19:51:53,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 55 transitions, 291 flow, removed 3 selfloop flow, removed 8 redundant places. [2023-08-29 19:51:53,549 INFO L231 Difference]: Finished difference. Result has 61 places, 0 transitions, 0 flow [2023-08-29 19:51:53,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=61, PETRI_TRANSITIONS=0} [2023-08-29 19:51:53,549 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2023-08-29 19:51:53,549 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 0 transitions, 0 flow [2023-08-29 19:51:53,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:51:53,549 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 15 remaining) [2023-08-29 19:51:53,549 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 15 remaining) [2023-08-29 19:51:53,549 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-08-29 19:51:53,549 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (11 of 15 remaining) [2023-08-29 19:51:53,550 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-08-29 19:51:53,550 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (9 of 15 remaining) [2023-08-29 19:51:53,550 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-08-29 19:51:53,550 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-08-29 19:51:53,550 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (6 of 15 remaining) [2023-08-29 19:51:53,550 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2023-08-29 19:51:53,550 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2023-08-29 19:51:53,550 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2023-08-29 19:51:53,550 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 15 remaining) [2023-08-29 19:51:53,550 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2023-08-29 19:51:53,550 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (0 of 15 remaining) [2023-08-29 19:51:53,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2023-08-29 19:51:53,551 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 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] [2023-08-29 19:51:53,551 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-29 19:51:53,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 180 transitions, 381 flow [2023-08-29 19:51:53,565 INFO L130 PetriNetUnfolder]: 25/229 cut-off events. [2023-08-29 19:51:53,565 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-08-29 19:51:53,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 229 events. 25/229 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 643 event pairs, 0 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 169. Up to 8 conditions per place. [2023-08-29 19:51:53,566 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 180 transitions, 381 flow [2023-08-29 19:51:53,567 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 180 transitions, 381 flow [2023-08-29 19:51:53,567 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 19:51:53,567 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 180 transitions, 381 flow [2023-08-29 19:51:53,567 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 180 transitions, 381 flow [2023-08-29 19:51:53,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 180 transitions, 381 flow [2023-08-29 19:51:53,578 INFO L130 PetriNetUnfolder]: 25/229 cut-off events. [2023-08-29 19:51:53,578 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-08-29 19:51:53,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 229 events. 25/229 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 643 event pairs, 0 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 169. Up to 8 conditions per place. [2023-08-29 19:51:53,585 INFO L119 LiptonReduction]: Number of co-enabled transitions 17940 [2023-08-29 19:51:56,533 INFO L134 LiptonReduction]: Checked pairs total: 28465 [2023-08-29 19:51:56,534 INFO L136 LiptonReduction]: Total number of compositions: 178 [2023-08-29 19:51:56,534 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-29 19:51:56,535 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4bf4d96b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 19:51:56,535 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-29 19:51:56,539 INFO L130 PetriNetUnfolder]: 10/69 cut-off events. [2023-08-29 19:51:56,539 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-08-29 19:51:56,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:51:56,539 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2023-08-29 19:51:56,539 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 19:51:56,539 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:51:56,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1196508273, now seen corresponding path program 1 times [2023-08-29 19:51:56,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:51:56,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853321799] [2023-08-29 19:51:56,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:51:56,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:51:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 19:51:56,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 19:51:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 19:51:56,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 19:51:56,551 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 19:51:56,551 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-29 19:51:56,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2023-08-29 19:51:56,552 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-29 19:51:56,552 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-29 19:51:56,552 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 19:51:56,552 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-08-29 19:51:56,572 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 19:51:56,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 207 places, 227 transitions, 486 flow [2023-08-29 19:51:56,593 INFO L130 PetriNetUnfolder]: 33/293 cut-off events. [2023-08-29 19:51:56,593 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-29 19:51:56,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 293 events. 33/293 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 931 event pairs, 0 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 237. Up to 10 conditions per place. [2023-08-29 19:51:56,594 INFO L82 GeneralOperation]: Start removeDead. Operand has 207 places, 227 transitions, 486 flow [2023-08-29 19:51:56,596 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 227 transitions, 486 flow [2023-08-29 19:51:56,596 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 19:51:56,597 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 207 places, 227 transitions, 486 flow [2023-08-29 19:51:56,597 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 207 places, 227 transitions, 486 flow [2023-08-29 19:51:56,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 207 places, 227 transitions, 486 flow [2023-08-29 19:51:56,622 INFO L130 PetriNetUnfolder]: 33/293 cut-off events. [2023-08-29 19:51:56,622 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-29 19:51:56,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 293 events. 33/293 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 931 event pairs, 0 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 237. Up to 10 conditions per place. [2023-08-29 19:51:56,632 INFO L119 LiptonReduction]: Number of co-enabled transitions 32568 [2023-08-29 19:52:00,354 INFO L134 LiptonReduction]: Checked pairs total: 48325 [2023-08-29 19:52:00,354 INFO L136 LiptonReduction]: Total number of compositions: 218 [2023-08-29 19:52:00,355 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 19:52:00,356 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4bf4d96b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 19:52:00,356 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-29 19:52:00,356 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 19:52:00,357 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:52:00,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:52:00,357 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 19:52:00,357 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 15 more)] === [2023-08-29 19:52:00,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:52:00,357 INFO L85 PathProgramCache]: Analyzing trace with hash 64485, now seen corresponding path program 1 times [2023-08-29 19:52:00,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:52:00,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510790293] [2023-08-29 19:52:00,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:52:00,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:52:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:52:00,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:52:00,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:52:00,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510790293] [2023-08-29 19:52:00,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510790293] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:52:00,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:52:00,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:52:00,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997158028] [2023-08-29 19:52:00,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:52:00,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 19:52:00,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:52:00,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 19:52:00,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 19:52:00,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 445 [2023-08-29 19:52:00,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 69 transitions, 170 flow. Second operand has 2 states, 2 states have (on average 198.0) internal successors, (396), 2 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:00,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:52:00,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 445 [2023-08-29 19:52:00,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:52:03,301 INFO L130 PetriNetUnfolder]: 42152/60736 cut-off events. [2023-08-29 19:52:03,301 INFO L131 PetriNetUnfolder]: For 5321/5321 co-relation queries the response was YES. [2023-08-29 19:52:03,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115608 conditions, 60736 events. 42152/60736 cut-off events. For 5321/5321 co-relation queries the response was YES. Maximal size of possible extension queue 3482. Compared 453508 event pairs, 34416 based on Foata normal form. 6079/40805 useless extension candidates. Maximal degree in co-relation 13312. Up to 51757 conditions per place. [2023-08-29 19:52:03,626 INFO L137 encePairwiseOnDemand]: 435/445 looper letters, 36 selfloop transitions, 0 changer transitions 0/59 dead transitions. [2023-08-29 19:52:03,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 59 transitions, 222 flow [2023-08-29 19:52:03,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 19:52:03,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 19:52:03,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 440 transitions. [2023-08-29 19:52:03,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4943820224719101 [2023-08-29 19:52:03,627 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 440 transitions. [2023-08-29 19:52:03,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 440 transitions. [2023-08-29 19:52:03,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:52:03,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 440 transitions. [2023-08-29 19:52:03,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 220.0) internal successors, (440), 2 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:03,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 445.0) internal successors, (1335), 3 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:03,629 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 445.0) internal successors, (1335), 3 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:03,629 INFO L175 Difference]: Start difference. First operand has 62 places, 69 transitions, 170 flow. Second operand 2 states and 440 transitions. [2023-08-29 19:52:03,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 59 transitions, 222 flow [2023-08-29 19:52:03,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 59 transitions, 210 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-08-29 19:52:03,632 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 138 flow [2023-08-29 19:52:03,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=138, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2023-08-29 19:52:03,632 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2023-08-29 19:52:03,632 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 138 flow [2023-08-29 19:52:03,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 198.0) internal successors, (396), 2 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:03,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:52:03,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 19:52:03,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2023-08-29 19:52:03,633 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 15 more)] === [2023-08-29 19:52:03,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:52:03,633 INFO L85 PathProgramCache]: Analyzing trace with hash 64473, now seen corresponding path program 1 times [2023-08-29 19:52:03,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:52:03,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334021733] [2023-08-29 19:52:03,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:52:03,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:52:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:52:03,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:52:03,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:52:03,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334021733] [2023-08-29 19:52:03,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334021733] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:52:03,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:52:03,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:52:03,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019282860] [2023-08-29 19:52:03,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:52:03,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:52:03,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:52:03,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:52:03,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:52:03,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 445 [2023-08-29 19:52:03,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:03,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:52:03,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 445 [2023-08-29 19:52:03,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:52:06,397 INFO L130 PetriNetUnfolder]: 31014/45197 cut-off events. [2023-08-29 19:52:06,397 INFO L131 PetriNetUnfolder]: For 1099/1099 co-relation queries the response was YES. [2023-08-29 19:52:06,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84914 conditions, 45197 events. 31014/45197 cut-off events. For 1099/1099 co-relation queries the response was YES. Maximal size of possible extension queue 2521. Compared 329517 event pairs, 25212 based on Foata normal form. 0/26990 useless extension candidates. Maximal degree in co-relation 84907. Up to 38217 conditions per place. [2023-08-29 19:52:06,637 INFO L137 encePairwiseOnDemand]: 443/445 looper letters, 34 selfloop transitions, 1 changer transitions 0/58 dead transitions. [2023-08-29 19:52:06,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 206 flow [2023-08-29 19:52:06,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:52:06,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:52:06,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 609 transitions. [2023-08-29 19:52:06,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45617977528089887 [2023-08-29 19:52:06,638 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 609 transitions. [2023-08-29 19:52:06,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 609 transitions. [2023-08-29 19:52:06,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:52:06,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 609 transitions. [2023-08-29 19:52:06,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:06,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 445.0) internal successors, (1780), 4 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:06,640 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 445.0) internal successors, (1780), 4 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:06,640 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 138 flow. Second operand 3 states and 609 transitions. [2023-08-29 19:52:06,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 206 flow [2023-08-29 19:52:06,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 58 transitions, 206 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 19:52:06,641 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 138 flow [2023-08-29 19:52:06,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2023-08-29 19:52:06,641 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 0 predicate places. [2023-08-29 19:52:06,641 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 138 flow [2023-08-29 19:52:06,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:06,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:52:06,642 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 19:52:06,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2023-08-29 19:52:06,642 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 15 more)] === [2023-08-29 19:52:06,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:52:06,642 INFO L85 PathProgramCache]: Analyzing trace with hash 64475, now seen corresponding path program 1 times [2023-08-29 19:52:06,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:52:06,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643127551] [2023-08-29 19:52:06,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:52:06,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:52:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:52:06,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:52:06,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:52:06,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643127551] [2023-08-29 19:52:06,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643127551] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:52:06,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:52:06,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:52:06,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408652075] [2023-08-29 19:52:06,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:52:06,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:52:06,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:52:06,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:52:06,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:52:06,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 445 [2023-08-29 19:52:06,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:06,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:52:06,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 445 [2023-08-29 19:52:06,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:52:08,430 INFO L130 PetriNetUnfolder]: 19876/29658 cut-off events. [2023-08-29 19:52:08,430 INFO L131 PetriNetUnfolder]: For 1099/1099 co-relation queries the response was YES. [2023-08-29 19:52:08,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55838 conditions, 29658 events. 19876/29658 cut-off events. For 1099/1099 co-relation queries the response was YES. Maximal size of possible extension queue 1567. Compared 210593 event pairs, 16008 based on Foata normal form. 0/19254 useless extension candidates. Maximal degree in co-relation 55830. Up to 24678 conditions per place. [2023-08-29 19:52:08,571 INFO L137 encePairwiseOnDemand]: 443/445 looper letters, 33 selfloop transitions, 1 changer transitions 0/57 dead transitions. [2023-08-29 19:52:08,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 57 transitions, 204 flow [2023-08-29 19:52:08,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:52:08,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:52:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 614 transitions. [2023-08-29 19:52:08,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4599250936329588 [2023-08-29 19:52:08,572 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 614 transitions. [2023-08-29 19:52:08,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 614 transitions. [2023-08-29 19:52:08,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:52:08,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 614 transitions. [2023-08-29 19:52:08,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:08,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 445.0) internal successors, (1780), 4 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:08,575 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 445.0) internal successors, (1780), 4 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:08,575 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 138 flow. Second operand 3 states and 614 transitions. [2023-08-29 19:52:08,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 57 transitions, 204 flow [2023-08-29 19:52:08,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 57 transitions, 203 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:52:08,577 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 137 flow [2023-08-29 19:52:08,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2023-08-29 19:52:08,577 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 0 predicate places. [2023-08-29 19:52:08,577 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 137 flow [2023-08-29 19:52:08,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:08,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:52:08,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 19:52:08,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2023-08-29 19:52:08,578 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 15 more)] === [2023-08-29 19:52:08,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:52:08,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1922511240, now seen corresponding path program 1 times [2023-08-29 19:52:08,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:52:08,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428416672] [2023-08-29 19:52:08,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:52:08,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:52:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:52:08,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:52:08,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:52:08,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428416672] [2023-08-29 19:52:08,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428416672] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:52:08,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:52:08,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:52:08,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134142475] [2023-08-29 19:52:08,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:52:08,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:52:08,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:52:08,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:52:08,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:52:08,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 445 [2023-08-29 19:52:08,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 190.25) internal successors, (761), 4 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:08,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:52:08,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 445 [2023-08-29 19:52:08,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:52:11,086 INFO L130 PetriNetUnfolder]: 25410/36740 cut-off events. [2023-08-29 19:52:11,086 INFO L131 PetriNetUnfolder]: For 1441/1441 co-relation queries the response was YES. [2023-08-29 19:52:11,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70313 conditions, 36740 events. 25410/36740 cut-off events. For 1441/1441 co-relation queries the response was YES. Maximal size of possible extension queue 1906. Compared 258541 event pairs, 14590 based on Foata normal form. 0/23506 useless extension candidates. Maximal degree in co-relation 70305. Up to 24678 conditions per place. [2023-08-29 19:52:11,263 INFO L137 encePairwiseOnDemand]: 440/445 looper letters, 58 selfloop transitions, 3 changer transitions 0/84 dead transitions. [2023-08-29 19:52:11,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 84 transitions, 328 flow [2023-08-29 19:52:11,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:52:11,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:52:11,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 819 transitions. [2023-08-29 19:52:11,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4601123595505618 [2023-08-29 19:52:11,265 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 819 transitions. [2023-08-29 19:52:11,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 819 transitions. [2023-08-29 19:52:11,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:52:11,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 819 transitions. [2023-08-29 19:52:11,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 204.75) internal successors, (819), 4 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:11,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 445.0) internal successors, (2225), 5 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:11,268 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 445.0) internal successors, (2225), 5 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:11,268 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 137 flow. Second operand 4 states and 819 transitions. [2023-08-29 19:52:11,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 84 transitions, 328 flow [2023-08-29 19:52:11,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 84 transitions, 327 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:52:11,269 INFO L231 Difference]: Finished difference. Result has 65 places, 58 transitions, 152 flow [2023-08-29 19:52:11,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=65, PETRI_TRANSITIONS=58} [2023-08-29 19:52:11,270 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2023-08-29 19:52:11,270 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 58 transitions, 152 flow [2023-08-29 19:52:11,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 190.25) internal successors, (761), 4 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:11,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:52:11,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 19:52:11,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2023-08-29 19:52:11,271 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 15 more)] === [2023-08-29 19:52:11,271 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:52:11,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1922511239, now seen corresponding path program 1 times [2023-08-29 19:52:11,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:52:11,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146183675] [2023-08-29 19:52:11,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:52:11,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:52:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:52:11,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:52:11,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:52:11,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146183675] [2023-08-29 19:52:11,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146183675] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:52:11,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:52:11,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:52:11,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117371865] [2023-08-29 19:52:11,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:52:11,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:52:11,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:52:11,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:52:11,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:52:11,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 445 [2023-08-29 19:52:11,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 58 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:11,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:52:11,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 445 [2023-08-29 19:52:11,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:52:12,622 INFO L130 PetriNetUnfolder]: 12881/19631 cut-off events. [2023-08-29 19:52:12,623 INFO L131 PetriNetUnfolder]: For 3403/3403 co-relation queries the response was YES. [2023-08-29 19:52:12,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39773 conditions, 19631 events. 12881/19631 cut-off events. For 3403/3403 co-relation queries the response was YES. Maximal size of possible extension queue 939. Compared 134808 event pairs, 10067 based on Foata normal form. 1036/15336 useless extension candidates. Maximal degree in co-relation 39764. Up to 15907 conditions per place. [2023-08-29 19:52:12,735 INFO L137 encePairwiseOnDemand]: 440/445 looper letters, 30 selfloop transitions, 1 changer transitions 0/54 dead transitions. [2023-08-29 19:52:12,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 54 transitions, 206 flow [2023-08-29 19:52:12,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:52:12,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:52:12,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions. [2023-08-29 19:52:12,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4344569288389513 [2023-08-29 19:52:12,737 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 580 transitions. [2023-08-29 19:52:12,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 580 transitions. [2023-08-29 19:52:12,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:52:12,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 580 transitions. [2023-08-29 19:52:12,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:12,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 445.0) internal successors, (1780), 4 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:12,739 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 445.0) internal successors, (1780), 4 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:12,739 INFO L175 Difference]: Start difference. First operand has 65 places, 58 transitions, 152 flow. Second operand 3 states and 580 transitions. [2023-08-29 19:52:12,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 54 transitions, 206 flow [2023-08-29 19:52:12,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 54 transitions, 200 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 19:52:12,740 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 140 flow [2023-08-29 19:52:12,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2023-08-29 19:52:12,740 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2023-08-29 19:52:12,741 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 140 flow [2023-08-29 19:52:12,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:12,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:52:12,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-29 19:52:12,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2023-08-29 19:52:12,741 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 15 more)] === [2023-08-29 19:52:12,741 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:52:12,741 INFO L85 PathProgramCache]: Analyzing trace with hash -531688012, now seen corresponding path program 1 times [2023-08-29 19:52:12,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:52:12,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106940383] [2023-08-29 19:52:12,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:52:12,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:52:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:52:12,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:52:12,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:52:12,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106940383] [2023-08-29 19:52:12,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106940383] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:52:12,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455015202] [2023-08-29 19:52:12,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:52:12,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:52:12,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:52:12,865 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 19:52:12,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-08-29 19:52:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:52:12,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-29 19:52:12,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:52:12,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:52:12,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:52:13,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:52:13,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:52:13,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:52:13,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455015202] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:52:13,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:52:13,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2023-08-29 19:52:13,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95312376] [2023-08-29 19:52:13,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:52:13,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 19:52:13,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:52:13,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 19:52:13,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-08-29 19:52:13,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 445 [2023-08-29 19:52:13,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 140 flow. Second operand has 11 states, 11 states have (on average 187.63636363636363) internal successors, (2064), 11 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:13,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:52:13,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 445 [2023-08-29 19:52:13,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:52:15,507 INFO L130 PetriNetUnfolder]: 20331/30781 cut-off events. [2023-08-29 19:52:15,508 INFO L131 PetriNetUnfolder]: For 2386/2386 co-relation queries the response was YES. [2023-08-29 19:52:15,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60497 conditions, 30781 events. 20331/30781 cut-off events. For 2386/2386 co-relation queries the response was YES. Maximal size of possible extension queue 1491. Compared 229613 event pairs, 8555 based on Foata normal form. 0/22611 useless extension candidates. Maximal degree in co-relation 60488. Up to 13635 conditions per place. [2023-08-29 19:52:15,682 INFO L137 encePairwiseOnDemand]: 441/445 looper letters, 75 selfloop transitions, 4 changer transitions 0/102 dead transitions. [2023-08-29 19:52:15,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 102 transitions, 428 flow [2023-08-29 19:52:15,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 19:52:15,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 19:52:15,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1010 transitions. [2023-08-29 19:52:15,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45393258426966293 [2023-08-29 19:52:15,684 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1010 transitions. [2023-08-29 19:52:15,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1010 transitions. [2023-08-29 19:52:15,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:52:15,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1010 transitions. [2023-08-29 19:52:15,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:15,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 445.0) internal successors, (2670), 6 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:15,686 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 445.0) internal successors, (2670), 6 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:15,686 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 140 flow. Second operand 5 states and 1010 transitions. [2023-08-29 19:52:15,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 102 transitions, 428 flow [2023-08-29 19:52:15,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 102 transitions, 427 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:52:15,689 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 157 flow [2023-08-29 19:52:15,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2023-08-29 19:52:15,689 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2023-08-29 19:52:15,689 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 157 flow [2023-08-29 19:52:15,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 187.63636363636363) internal successors, (2064), 11 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:15,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:52:15,690 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-29 19:52:15,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-08-29 19:52:15,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2023-08-29 19:52:15,890 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 15 more)] === [2023-08-29 19:52:15,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:52:15,891 INFO L85 PathProgramCache]: Analyzing trace with hash 697546504, now seen corresponding path program 2 times [2023-08-29 19:52:15,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:52:15,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875236873] [2023-08-29 19:52:15,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:52:15,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:52:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:52:15,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:52:15,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:52:15,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875236873] [2023-08-29 19:52:15,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875236873] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:52:15,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022652402] [2023-08-29 19:52:15,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 19:52:15,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:52:15,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:52:15,918 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 19:52:15,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-08-29 19:52:15,995 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 19:52:15,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:52:15,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 19:52:15,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:52:16,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:52:16,144 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:52:16,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022652402] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:52:16,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 19:52:16,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-29 19:52:16,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107609766] [2023-08-29 19:52:16,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:52:16,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:52:16,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:52:16,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:52:16,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:52:16,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 445 [2023-08-29 19:52:16,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 191.4) internal successors, (957), 5 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:16,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:52:16,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 445 [2023-08-29 19:52:16,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:52:18,065 INFO L130 PetriNetUnfolder]: 18145/28267 cut-off events. [2023-08-29 19:52:18,065 INFO L131 PetriNetUnfolder]: For 3872/3872 co-relation queries the response was YES. [2023-08-29 19:52:18,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55952 conditions, 28267 events. 18145/28267 cut-off events. For 3872/3872 co-relation queries the response was YES. Maximal size of possible extension queue 1442. Compared 223016 event pairs, 1131 based on Foata normal form. 518/22780 useless extension candidates. Maximal degree in co-relation 55942. Up to 15904 conditions per place. [2023-08-29 19:52:18,210 INFO L137 encePairwiseOnDemand]: 441/445 looper letters, 93 selfloop transitions, 4 changer transitions 0/120 dead transitions. [2023-08-29 19:52:18,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 120 transitions, 520 flow [2023-08-29 19:52:18,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 19:52:18,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 19:52:18,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1049 transitions. [2023-08-29 19:52:18,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47146067415730336 [2023-08-29 19:52:18,212 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1049 transitions. [2023-08-29 19:52:18,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1049 transitions. [2023-08-29 19:52:18,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:52:18,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1049 transitions. [2023-08-29 19:52:18,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 209.8) internal successors, (1049), 5 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:18,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 445.0) internal successors, (2670), 6 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:18,214 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 445.0) internal successors, (2670), 6 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:18,214 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 157 flow. Second operand 5 states and 1049 transitions. [2023-08-29 19:52:18,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 120 transitions, 520 flow [2023-08-29 19:52:18,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 120 transitions, 512 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 19:52:18,228 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 154 flow [2023-08-29 19:52:18,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2023-08-29 19:52:18,228 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2023-08-29 19:52:18,228 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 154 flow [2023-08-29 19:52:18,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 191.4) internal successors, (957), 5 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:18,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:52:18,228 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:52:18,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-08-29 19:52:18,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:52:18,429 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 15 more)] === [2023-08-29 19:52:18,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:52:18,430 INFO L85 PathProgramCache]: Analyzing trace with hash -222095688, now seen corresponding path program 1 times [2023-08-29 19:52:18,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:52:18,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380006122] [2023-08-29 19:52:18,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:52:18,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:52:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:52:18,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 19:52:18,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:52:18,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380006122] [2023-08-29 19:52:18,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380006122] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:52:18,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:52:18,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:52:18,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207380361] [2023-08-29 19:52:18,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:52:18,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:52:18,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:52:18,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:52:18,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:52:18,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 445 [2023-08-29 19:52:18,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 190.5) internal successors, (762), 4 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:18,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:52:18,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 445 [2023-08-29 19:52:18,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:52:20,809 INFO L130 PetriNetUnfolder]: 20823/30823 cut-off events. [2023-08-29 19:52:20,810 INFO L131 PetriNetUnfolder]: For 12226/12226 co-relation queries the response was YES. [2023-08-29 19:52:20,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65785 conditions, 30823 events. 20823/30823 cut-off events. For 12226/12226 co-relation queries the response was YES. Maximal size of possible extension queue 1423. Compared 218100 event pairs, 13143 based on Foata normal form. 0/24043 useless extension candidates. Maximal degree in co-relation 65775. Up to 22205 conditions per place. [2023-08-29 19:52:20,967 INFO L137 encePairwiseOnDemand]: 440/445 looper letters, 51 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2023-08-29 19:52:20,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 77 transitions, 341 flow [2023-08-29 19:52:20,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:52:20,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:52:20,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 808 transitions. [2023-08-29 19:52:20,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45393258426966293 [2023-08-29 19:52:20,968 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 808 transitions. [2023-08-29 19:52:20,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 808 transitions. [2023-08-29 19:52:20,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:52:20,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 808 transitions. [2023-08-29 19:52:20,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:20,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 445.0) internal successors, (2225), 5 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:20,970 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 445.0) internal successors, (2225), 5 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:20,970 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 154 flow. Second operand 4 states and 808 transitions. [2023-08-29 19:52:20,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 77 transitions, 341 flow [2023-08-29 19:52:20,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 77 transitions, 319 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-29 19:52:20,973 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 159 flow [2023-08-29 19:52:20,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2023-08-29 19:52:20,973 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2023-08-29 19:52:20,973 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 159 flow [2023-08-29 19:52:20,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 190.5) internal successors, (762), 4 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:20,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:52:20,973 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:52:20,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2023-08-29 19:52:20,973 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 15 more)] === [2023-08-29 19:52:20,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:52:20,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1704974393, now seen corresponding path program 1 times [2023-08-29 19:52:20,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:52:20,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440204992] [2023-08-29 19:52:20,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:52:20,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:52:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:52:21,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 19:52:21,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:52:21,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440204992] [2023-08-29 19:52:21,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440204992] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:52:21,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990528219] [2023-08-29 19:52:21,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:52:21,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:52:21,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:52:21,086 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 19:52:21,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-08-29 19:52:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:52:21,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-29 19:52:21,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:52:21,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:52:21,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:52:21,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 19:52:21,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:52:21,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 19:52:21,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990528219] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:52:21,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:52:21,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2023-08-29 19:52:21,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908684375] [2023-08-29 19:52:21,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:52:21,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 19:52:21,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:52:21,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 19:52:21,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-08-29 19:52:21,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 445 [2023-08-29 19:52:21,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 159 flow. Second operand has 11 states, 11 states have (on average 187.9090909090909) internal successors, (2067), 11 states have internal predecessors, (2067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:21,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:52:21,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 445 [2023-08-29 19:52:21,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:52:24,240 INFO L130 PetriNetUnfolder]: 23705/35839 cut-off events. [2023-08-29 19:52:24,241 INFO L131 PetriNetUnfolder]: For 9659/9659 co-relation queries the response was YES. [2023-08-29 19:52:24,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78293 conditions, 35839 events. 23705/35839 cut-off events. For 9659/9659 co-relation queries the response was YES. Maximal size of possible extension queue 1682. Compared 270592 event pairs, 10067 based on Foata normal form. 0/28540 useless extension candidates. Maximal degree in co-relation 78282. Up to 15907 conditions per place. [2023-08-29 19:52:24,472 INFO L137 encePairwiseOnDemand]: 441/445 looper letters, 76 selfloop transitions, 4 changer transitions 0/103 dead transitions. [2023-08-29 19:52:24,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 103 transitions, 463 flow [2023-08-29 19:52:24,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 19:52:24,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 19:52:24,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1005 transitions. [2023-08-29 19:52:24,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.451685393258427 [2023-08-29 19:52:24,474 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1005 transitions. [2023-08-29 19:52:24,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1005 transitions. [2023-08-29 19:52:24,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:52:24,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1005 transitions. [2023-08-29 19:52:24,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:24,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 445.0) internal successors, (2670), 6 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:24,476 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 445.0) internal successors, (2670), 6 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:24,476 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 159 flow. Second operand 5 states and 1005 transitions. [2023-08-29 19:52:24,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 103 transitions, 463 flow [2023-08-29 19:52:24,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 103 transitions, 457 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 19:52:24,483 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 171 flow [2023-08-29 19:52:24,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2023-08-29 19:52:24,483 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2023-08-29 19:52:24,483 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 171 flow [2023-08-29 19:52:24,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 187.9090909090909) internal successors, (2067), 11 states have internal predecessors, (2067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:24,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:52:24,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:52:24,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-08-29 19:52:24,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:52:24,685 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 15 more)] === [2023-08-29 19:52:24,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:52:24,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1460313811, now seen corresponding path program 1 times [2023-08-29 19:52:24,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:52:24,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86553143] [2023-08-29 19:52:24,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:52:24,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:52:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:52:24,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 19:52:24,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:52:24,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86553143] [2023-08-29 19:52:24,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86553143] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:52:24,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:52:24,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:52:24,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074425024] [2023-08-29 19:52:24,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:52:24,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:52:24,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:52:24,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:52:24,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:52:24,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 445 [2023-08-29 19:52:24,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 171 flow. Second operand has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:24,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:52:24,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 445 [2023-08-29 19:52:24,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:52:30,644 INFO L130 PetriNetUnfolder]: 60372/86283 cut-off events. [2023-08-29 19:52:30,644 INFO L131 PetriNetUnfolder]: For 27018/27018 co-relation queries the response was YES. [2023-08-29 19:52:30,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189403 conditions, 86283 events. 60372/86283 cut-off events. For 27018/27018 co-relation queries the response was YES. Maximal size of possible extension queue 3865. Compared 652421 event pairs, 31914 based on Foata normal form. 0/71655 useless extension candidates. Maximal degree in co-relation 189391. Up to 56645 conditions per place. [2023-08-29 19:52:31,335 INFO L137 encePairwiseOnDemand]: 438/445 looper letters, 63 selfloop transitions, 6 changer transitions 0/85 dead transitions. [2023-08-29 19:52:31,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 85 transitions, 404 flow [2023-08-29 19:52:31,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:52:31,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:52:31,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 619 transitions. [2023-08-29 19:52:31,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46367041198501874 [2023-08-29 19:52:31,337 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 619 transitions. [2023-08-29 19:52:31,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 619 transitions. [2023-08-29 19:52:31,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:52:31,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 619 transitions. [2023-08-29 19:52:31,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:31,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 445.0) internal successors, (1780), 4 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:31,339 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 445.0) internal successors, (1780), 4 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:31,339 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 171 flow. Second operand 3 states and 619 transitions. [2023-08-29 19:52:31,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 85 transitions, 404 flow [2023-08-29 19:52:31,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 85 transitions, 394 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 19:52:31,351 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 207 flow [2023-08-29 19:52:31,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=207, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2023-08-29 19:52:31,351 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2023-08-29 19:52:31,351 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 207 flow [2023-08-29 19:52:31,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:31,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:52:31,352 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:52:31,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2023-08-29 19:52:31,352 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 15 more)] === [2023-08-29 19:52:31,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:52:31,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1314604760, now seen corresponding path program 2 times [2023-08-29 19:52:31,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:52:31,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756933070] [2023-08-29 19:52:31,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:52:31,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:52:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:52:31,386 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 19:52:31,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:52:31,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756933070] [2023-08-29 19:52:31,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756933070] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:52:31,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054578262] [2023-08-29 19:52:31,387 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 19:52:31,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:52:31,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:52:31,389 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 19:52:31,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-08-29 19:52:31,479 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 19:52:31,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:52:31,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 19:52:31,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:52:31,489 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 19:52:31,489 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:52:31,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054578262] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:52:31,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 19:52:31,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-29 19:52:31,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546877756] [2023-08-29 19:52:31,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:52:31,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:52:31,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:52:31,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:52:31,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:52:31,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 445 [2023-08-29 19:52:31,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 207 flow. Second operand has 5 states, 5 states have (on average 191.6) internal successors, (958), 5 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:31,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:52:31,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 445 [2023-08-29 19:52:31,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:52:34,478 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][89], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 159#L714-1true, 95#L718true, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 392#true, Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:34,478 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-29 19:52:34,478 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:34,478 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:34,478 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:34,591 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][89], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 18#thr1EXITtrue, Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 159#L714-1true, 95#L718true, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 392#true, Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:34,591 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 19:52:34,592 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:34,592 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:34,592 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:34,599 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][89], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), Black: 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, 159#L714-1true, 95#L718true, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 392#true, 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:34,599 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 19:52:34,599 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:34,599 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:34,599 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:34,684 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][89], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 18#thr1EXITtrue, Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), Black: 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 210#true, thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, 159#L714-1true, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 392#true, 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:34,684 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:52:34,684 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:34,684 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:34,684 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:34,708 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][89], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, 159#L714-1true, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 392#true, 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:34,708 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:52:34,708 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:34,708 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:34,708 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:34,746 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][89], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 18#thr1EXITtrue, Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, 159#L714-1true, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 392#true, 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:34,746 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:52:34,746 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:34,746 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:34,746 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:34,753 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][89], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), Black: 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, 159#L714-1true, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 392#true, 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:34,753 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:52:34,753 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:34,753 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:34,753 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:34,779 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][89], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 18#thr1EXITtrue, Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), Black: 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 210#true, thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, 159#L714-1true, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 392#true, Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:34,779 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:52:34,779 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:34,780 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:34,780 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:52:34,795 INFO L130 PetriNetUnfolder]: 30558/47957 cut-off events. [2023-08-29 19:52:34,795 INFO L131 PetriNetUnfolder]: For 14665/15456 co-relation queries the response was YES. [2023-08-29 19:52:34,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104527 conditions, 47957 events. 30558/47957 cut-off events. For 14665/15456 co-relation queries the response was YES. Maximal size of possible extension queue 2328. Compared 406316 event pairs, 1741 based on Foata normal form. 782/41196 useless extension candidates. Maximal degree in co-relation 104514. Up to 27655 conditions per place. [2023-08-29 19:52:35,131 INFO L137 encePairwiseOnDemand]: 441/445 looper letters, 98 selfloop transitions, 4 changer transitions 0/128 dead transitions. [2023-08-29 19:52:35,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 128 transitions, 625 flow [2023-08-29 19:52:35,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 19:52:35,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 19:52:35,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1042 transitions. [2023-08-29 19:52:35,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46831460674157305 [2023-08-29 19:52:35,133 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1042 transitions. [2023-08-29 19:52:35,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1042 transitions. [2023-08-29 19:52:35,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:52:35,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1042 transitions. [2023-08-29 19:52:35,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 208.4) internal successors, (1042), 5 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:35,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 445.0) internal successors, (2670), 6 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:35,136 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 445.0) internal successors, (2670), 6 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:35,136 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 207 flow. Second operand 5 states and 1042 transitions. [2023-08-29 19:52:35,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 128 transitions, 625 flow [2023-08-29 19:52:35,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 128 transitions, 605 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 19:52:35,199 INFO L231 Difference]: Finished difference. Result has 71 places, 59 transitions, 198 flow [2023-08-29 19:52:35,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=71, PETRI_TRANSITIONS=59} [2023-08-29 19:52:35,199 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 9 predicate places. [2023-08-29 19:52:35,199 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 59 transitions, 198 flow [2023-08-29 19:52:35,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 191.6) internal successors, (958), 5 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:35,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:52:35,199 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-29 19:52:35,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-08-29 19:52:35,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable74 [2023-08-29 19:52:35,400 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 15 more)] === [2023-08-29 19:52:35,400 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:52:35,401 INFO L85 PathProgramCache]: Analyzing trace with hash -93952448, now seen corresponding path program 1 times [2023-08-29 19:52:35,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:52:35,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644488770] [2023-08-29 19:52:35,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:52:35,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:52:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:52:35,482 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 19:52:35,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:52:35,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644488770] [2023-08-29 19:52:35,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644488770] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:52:35,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:52:35,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:52:35,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287467643] [2023-08-29 19:52:35,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:52:35,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:52:35,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:52:35,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:52:35,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:52:35,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 445 [2023-08-29 19:52:35,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 59 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 190.75) internal successors, (763), 4 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:35,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:52:35,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 445 [2023-08-29 19:52:35,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:52:38,555 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, 25#L705-6true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:38,555 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-29 19:52:38,555 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 19:52:38,555 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 19:52:38,555 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 19:52:38,748 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 182#L712true, 177#L729-5true, 183#thr1EXITtrue, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:38,748 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-29 19:52:38,748 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 19:52:38,748 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:38,748 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 19:52:38,748 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 37#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:38,748 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-29 19:52:38,749 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:38,749 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 19:52:38,749 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 19:52:38,749 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, 25#L705-6true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:38,749 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-29 19:52:38,749 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 19:52:38,749 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:38,749 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 19:52:38,759 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, 25#L705-6true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:38,759 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-29 19:52:38,759 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 19:52:38,759 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 19:52:38,759 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:38,768 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 76#L714-1true, 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:38,768 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-29 19:52:38,768 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 19:52:38,768 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:38,769 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 19:52:38,864 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, thr1Thread1of4ForFork0InUse, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 182#L712true, 177#L729-5true, 183#thr1EXITtrue, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:38,865 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 19:52:38,865 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:38,865 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:38,865 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:38,865 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 37#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:38,865 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 19:52:38,865 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:38,865 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:38,865 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:38,866 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, 177#L729-5true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:38,866 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 19:52:38,866 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:38,866 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:38,866 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:38,873 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 182#L712true, 183#thr1EXITtrue, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:38,873 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 19:52:38,873 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:38,874 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:38,874 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:38,874 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 37#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:38,874 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 19:52:38,874 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:38,874 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:38,874 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:38,874 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, thr1Thread1of4ForFork0InUse, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, 25#L705-6true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:38,874 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 19:52:38,874 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:38,875 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:38,875 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:38,881 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, thr1Thread1of4ForFork0InUse, 108#thr1EXITtrue, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 76#L714-1true, 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:38,881 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 19:52:38,881 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:38,881 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:38,881 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:38,881 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, 100#L718true, thr1Thread1of4ForFork0InUse, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 76#L714-1true, 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:38,881 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 19:52:38,881 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:38,881 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:38,881 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:38,883 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:38,883 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 19:52:38,883 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:38,883 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:38,884 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:38,908 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 25#L705-6true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:38,908 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:52:38,908 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:38,908 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:38,908 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:39,124 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,125 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,125 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:39,125 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,125 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:39,134 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 108#thr1EXITtrue, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, 177#L729-5true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,134 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,134 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:39,134 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,134 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:39,134 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 86#thr1EXITtrue, 210#true, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, 177#L729-5true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,134 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,134 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:39,135 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,135 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:39,141 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 182#L712true, 183#thr1EXITtrue, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,141 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,141 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:39,141 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,141 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:39,141 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 37#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 210#true, thr1Thread1of4ForFork0InUse, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,141 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,142 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:39,142 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,142 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:39,142 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, 177#L729-5true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,142 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,143 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:39,143 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:39,143 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,146 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 108#thr1EXITtrue, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 76#L714-1true, 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,146 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,146 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:39,146 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,146 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:39,148 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 108#thr1EXITtrue, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,148 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,148 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:39,148 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:39,148 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,148 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,148 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,148 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:39,149 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,149 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:39,167 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 182#L712true, 183#thr1EXITtrue, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,167 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,168 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,168 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,168 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,168 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 37#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,168 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,168 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,168 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,168 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,169 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, thr1Thread1of4ForFork0InUse, 108#thr1EXITtrue, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 25#L705-6true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,169 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,169 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,169 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,169 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,178 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 25#L705-6true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,178 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,178 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,178 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,178 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,187 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 76#L714-1true, 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,187 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,188 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,188 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,188 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,197 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, thr1Thread1of4ForFork0InUse, 108#thr1EXITtrue, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,197 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,198 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,198 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,198 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,198 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,198 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,198 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,198 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,198 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,200 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread2of4ForFork0InUse, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,200 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,200 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,200 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,200 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,203 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, 108#thr1EXITtrue, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, 177#L729-5true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,203 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,203 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,204 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,204 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,212 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, 177#L729-5true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,212 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,212 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,212 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,212 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,212 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, 177#L729-5true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,213 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,213 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,213 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,213 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,215 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 108#thr1EXITtrue, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,215 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,216 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,216 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:39,216 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,230 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 182#L712true, 183#thr1EXITtrue, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,230 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,230 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,230 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,230 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,231 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 37#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 210#true, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,231 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,231 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,231 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,231 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,232 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, thr1Thread1of4ForFork0InUse, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,232 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,232 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,232 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,232 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,239 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 182#L712true, 183#thr1EXITtrue, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,239 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,239 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,239 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,239 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,240 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 37#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 210#true, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,240 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,240 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,240 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,240 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,240 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 25#L705-6true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,240 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,240 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,240 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,240 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,246 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 76#L714-1true, 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,246 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,246 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,247 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,247 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,247 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, 100#L718true, thr1Thread1of4ForFork0InUse, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 76#L714-1true, 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,247 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,247 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,247 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,247 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,249 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,249 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,249 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,249 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,249 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,252 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 108#thr1EXITtrue, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,252 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,252 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,252 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,252 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,253 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 108#thr1EXITtrue, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread2of4ForFork0InUse, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,253 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,253 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,254 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,254 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,254 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread2of4ForFork0InUse, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,254 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,254 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,254 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,254 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,258 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, 177#L729-5true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,258 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,258 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,258 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,258 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:39,260 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,260 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,260 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,260 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,261 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,268 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,269 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,269 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,269 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,269 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,269 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,269 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,269 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,269 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,269 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,275 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 182#L712true, 183#thr1EXITtrue, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,275 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,276 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,276 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,276 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,276 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 37#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,276 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,276 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,276 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,276 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,277 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 116#L718true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,277 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,277 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,277 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,277 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,280 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 76#L714-1true, 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,280 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,281 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,281 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,281 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,282 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,282 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,282 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,282 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,282 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,283 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,283 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,283 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,283 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,283 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,284 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 108#thr1EXITtrue, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread2of4ForFork0InUse, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,284 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,284 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,284 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,284 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:39,287 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,287 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:52:39,287 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:52:39,288 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,288 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,288 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,288 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:52:39,288 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,288 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:52:39,288 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,290 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread2of4ForFork0InUse, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,290 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:52:39,290 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,290 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,290 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:52:39,293 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,293 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:52:39,293 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,293 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:52:39,293 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,297 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 116#L718true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,297 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:52:39,298 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,298 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,298 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:52:39,298 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 116#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,298 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:52:39,298 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,298 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:52:39,298 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,301 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,301 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:52:39,301 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,301 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:52:39,301 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:39,303 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 389#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,303 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:52:39,303 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:52:39,303 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:52:39,303 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:52:39,304 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,304 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:52:39,304 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:52:39,304 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:52:39,304 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:52:39,305 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread2of4ForFork0InUse, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,305 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:52:39,305 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:52:39,305 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:52:39,305 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:52:39,309 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 116#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,309 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:52:39,309 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:52:39,309 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:52:39,309 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:52:39,310 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:39,310 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 19:52:39,310 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:52:39,310 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:52:39,310 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:52:39,313 INFO L130 PetriNetUnfolder]: 34337/51445 cut-off events. [2023-08-29 19:52:39,313 INFO L131 PetriNetUnfolder]: For 25777/26845 co-relation queries the response was YES. [2023-08-29 19:52:39,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118626 conditions, 51445 events. 34337/51445 cut-off events. For 25777/26845 co-relation queries the response was YES. Maximal size of possible extension queue 2327. Compared 396371 event pairs, 23055 based on Foata normal form. 0/42593 useless extension candidates. Maximal degree in co-relation 118613. Up to 37382 conditions per place. [2023-08-29 19:52:39,631 INFO L137 encePairwiseOnDemand]: 440/445 looper letters, 54 selfloop transitions, 3 changer transitions 0/83 dead transitions. [2023-08-29 19:52:39,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 83 transitions, 404 flow [2023-08-29 19:52:39,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:52:39,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:52:39,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 805 transitions. [2023-08-29 19:52:39,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45224719101123595 [2023-08-29 19:52:39,633 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 805 transitions. [2023-08-29 19:52:39,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 805 transitions. [2023-08-29 19:52:39,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:52:39,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 805 transitions. [2023-08-29 19:52:39,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 201.25) internal successors, (805), 4 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:39,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 445.0) internal successors, (2225), 5 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:39,634 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 445.0) internal successors, (2225), 5 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:39,635 INFO L175 Difference]: Start difference. First operand has 71 places, 59 transitions, 198 flow. Second operand 4 states and 805 transitions. [2023-08-29 19:52:39,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 83 transitions, 404 flow [2023-08-29 19:52:39,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 83 transitions, 382 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-29 19:52:39,645 INFO L231 Difference]: Finished difference. Result has 72 places, 60 transitions, 203 flow [2023-08-29 19:52:39,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=203, PETRI_PLACES=72, PETRI_TRANSITIONS=60} [2023-08-29 19:52:39,645 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 10 predicate places. [2023-08-29 19:52:39,645 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 60 transitions, 203 flow [2023-08-29 19:52:39,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 190.75) internal successors, (763), 4 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:39,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:52:39,646 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:52:39,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2023-08-29 19:52:39,646 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 15 more)] === [2023-08-29 19:52:39,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:52:39,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1382447683, now seen corresponding path program 1 times [2023-08-29 19:52:39,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:52:39,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539648808] [2023-08-29 19:52:39,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:52:39,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:52:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:52:39,755 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 19:52:39,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:52:39,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539648808] [2023-08-29 19:52:39,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539648808] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:52:39,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694886228] [2023-08-29 19:52:39,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:52:39,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:52:39,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:52:39,757 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 19:52:39,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-08-29 19:52:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:52:39,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-29 19:52:39,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:52:39,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:52:39,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:52:39,942 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 19:52:39,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:52:40,017 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 19:52:40,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694886228] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:52:40,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:52:40,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2023-08-29 19:52:40,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910943616] [2023-08-29 19:52:40,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:52:40,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 19:52:40,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:52:40,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 19:52:40,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-08-29 19:52:40,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 445 [2023-08-29 19:52:40,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 60 transitions, 203 flow. Second operand has 11 states, 11 states have (on average 188.1818181818182) internal successors, (2070), 11 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:40,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:52:40,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 445 [2023-08-29 19:52:40,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:52:44,300 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][73], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 100#L718true, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 159#L714-1true, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,300 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 19:52:44,300 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:44,300 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:44,300 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:44,319 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 100#L718true, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 182#L712true, 177#L729-5true, 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,319 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 19:52:44,319 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:44,319 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:44,319 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:44,319 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 37#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 100#L718true, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,319 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 19:52:44,319 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:44,319 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:44,320 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:44,329 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 4#L718true, 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,329 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 19:52:44,329 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:44,329 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:44,329 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:52:44,394 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][73], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 159#L714-1true, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,394 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:52:44,395 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:44,395 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:44,395 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:44,408 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 100#L718true, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 182#L712true, 177#L729-5true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,409 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:52:44,409 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:44,409 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:44,409 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:44,409 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 37#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 100#L718true, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,409 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:52:44,409 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:44,409 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:44,409 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:44,410 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 100#L718true, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, 177#L729-5true, 4#L718true, 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,410 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:52:44,410 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:44,410 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:44,410 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:44,416 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 108#thr1EXITtrue, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 4#L718true, 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,416 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:52:44,416 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:44,416 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:44,416 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:44,416 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,416 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:52:44,416 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:44,416 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:44,416 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:52:44,466 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,467 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:52:44,467 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:44,467 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:44,467 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:44,474 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 100#L718true, 108#thr1EXITtrue, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, 177#L729-5true, 4#L718true, 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,474 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:52:44,474 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:44,474 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:44,474 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:44,475 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 86#thr1EXITtrue, 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 100#L718true, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, 177#L729-5true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,475 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:52:44,475 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:44,475 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:44,475 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:44,478 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 108#thr1EXITtrue, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,478 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:52:44,479 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:44,479 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:44,479 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:52:44,480 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][73], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 100#L718true, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 159#L714-1true, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,480 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:52:44,480 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:44,480 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:44,480 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:44,500 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, 95#L718true, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 182#L712true, 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,501 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:52:44,501 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:44,501 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:44,501 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:44,502 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 37#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 210#true, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, 95#L718true, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,502 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:52:44,502 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:44,502 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:44,502 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:44,516 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 4#L718true, 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,516 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:52:44,516 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:44,517 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:44,517 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:44,522 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, 4#L718true, 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,522 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:52:44,522 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:44,522 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:44,523 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:44,523 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,523 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:52:44,523 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:44,523 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:44,524 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:44,529 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, thr1Thread1of4ForFork0InUse, 108#thr1EXITtrue, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, 177#L729-5true, 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,529 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:52:44,529 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:44,529 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:44,529 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:52:44,532 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][73], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 159#L714-1true, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,532 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:52:44,532 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:44,533 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:52:44,533 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:44,547 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 100#L718true, 108#thr1EXITtrue, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 182#L712true, 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,547 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:52:44,547 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:44,547 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:44,547 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:44,548 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 37#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 100#L718true, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,548 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:52:44,548 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:44,548 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:44,548 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:44,548 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 100#L718true, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,548 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:52:44,548 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:44,548 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:44,549 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:44,554 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 4#L718true, 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,554 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:52:44,554 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:44,554 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:44,554 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:44,555 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,555 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:52:44,555 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:44,555 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:44,555 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:44,556 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,556 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:52:44,556 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:44,556 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:44,556 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:52:44,560 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 100#L718true, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,560 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:52:44,560 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:52:44,560 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:44,560 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:44,568 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 100#L718true, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, 4#L718true, 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,568 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:52:44,568 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:44,568 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:52:44,568 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:44,568 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 100#L718true, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,568 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:52:44,568 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:44,568 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:52:44,569 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:44,572 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,572 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:52:44,572 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:52:44,572 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:44,572 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:52:44,574 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 4#L718true, 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,574 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:52:44,574 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:52:44,574 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:52:44,575 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:52:44,575 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,575 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:52:44,575 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:52:44,576 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:52:44,576 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:52:44,579 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 100#L718true, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,579 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:52:44,579 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:52:44,579 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:52:44,579 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:52:44,581 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1755] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 210#true, 86#thr1EXITtrue, 100#L718true, 438#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread2of4ForFork0InUse, 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 534#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:52:44,581 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 19:52:44,582 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:52:44,582 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:52:44,582 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:52:44,584 INFO L130 PetriNetUnfolder]: 38159/57644 cut-off events. [2023-08-29 19:52:44,584 INFO L131 PetriNetUnfolder]: For 22771/23672 co-relation queries the response was YES. [2023-08-29 19:52:44,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136241 conditions, 57644 events. 38159/57644 cut-off events. For 22771/23672 co-relation queries the response was YES. Maximal size of possible extension queue 2663. Compared 458108 event pairs, 14502 based on Foata normal form. 0/48723 useless extension candidates. Maximal degree in co-relation 136227. Up to 25308 conditions per place. [2023-08-29 19:52:44,972 INFO L137 encePairwiseOnDemand]: 441/445 looper letters, 80 selfloop transitions, 4 changer transitions 0/110 dead transitions. [2023-08-29 19:52:44,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 110 transitions, 541 flow [2023-08-29 19:52:44,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 19:52:44,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 19:52:44,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1000 transitions. [2023-08-29 19:52:44,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.449438202247191 [2023-08-29 19:52:44,973 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1000 transitions. [2023-08-29 19:52:44,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1000 transitions. [2023-08-29 19:52:44,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:52:44,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1000 transitions. [2023-08-29 19:52:44,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:44,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 445.0) internal successors, (2670), 6 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:44,976 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 445.0) internal successors, (2670), 6 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:44,976 INFO L175 Difference]: Start difference. First operand has 72 places, 60 transitions, 203 flow. Second operand 5 states and 1000 transitions. [2023-08-29 19:52:44,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 110 transitions, 541 flow [2023-08-29 19:52:44,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 110 transitions, 535 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 19:52:45,000 INFO L231 Difference]: Finished difference. Result has 75 places, 61 transitions, 215 flow [2023-08-29 19:52:45,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=215, PETRI_PLACES=75, PETRI_TRANSITIONS=61} [2023-08-29 19:52:45,000 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 13 predicate places. [2023-08-29 19:52:45,000 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 61 transitions, 215 flow [2023-08-29 19:52:45,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 188.1818181818182) internal successors, (2070), 11 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:45,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:52:45,001 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:52:45,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-08-29 19:52:45,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76 [2023-08-29 19:52:45,201 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 15 more)] === [2023-08-29 19:52:45,202 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:52:45,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1771188824, now seen corresponding path program 1 times [2023-08-29 19:52:45,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:52:45,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226815959] [2023-08-29 19:52:45,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:52:45,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:52:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:52:45,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-29 19:52:45,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:52:45,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226815959] [2023-08-29 19:52:45,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226815959] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:52:45,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:52:45,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:52:45,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176655811] [2023-08-29 19:52:45,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:52:45,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:52:45,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:52:45,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:52:45,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:52:45,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 445 [2023-08-29 19:52:45,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 61 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:45,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:52:45,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 445 [2023-08-29 19:52:45,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:52:54,422 INFO L130 PetriNetUnfolder]: 88896/127726 cut-off events. [2023-08-29 19:52:54,422 INFO L131 PetriNetUnfolder]: For 65538/66932 co-relation queries the response was YES. [2023-08-29 19:52:54,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311466 conditions, 127726 events. 88896/127726 cut-off events. For 65538/66932 co-relation queries the response was YES. Maximal size of possible extension queue 5710. Compared 1017827 event pairs, 45430 based on Foata normal form. 72/112259 useless extension candidates. Maximal degree in co-relation 311451. Up to 81601 conditions per place. [2023-08-29 19:52:55,285 INFO L137 encePairwiseOnDemand]: 438/445 looper letters, 68 selfloop transitions, 9 changer transitions 0/93 dead transitions. [2023-08-29 19:52:55,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 93 transitions, 491 flow [2023-08-29 19:52:55,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:52:55,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:52:55,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 616 transitions. [2023-08-29 19:52:55,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46142322097378274 [2023-08-29 19:52:55,287 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 616 transitions. [2023-08-29 19:52:55,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 616 transitions. [2023-08-29 19:52:55,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:52:55,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 616 transitions. [2023-08-29 19:52:55,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:55,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 445.0) internal successors, (1780), 4 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:55,292 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 445.0) internal successors, (1780), 4 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:55,293 INFO L175 Difference]: Start difference. First operand has 75 places, 61 transitions, 215 flow. Second operand 3 states and 616 transitions. [2023-08-29 19:52:55,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 93 transitions, 491 flow [2023-08-29 19:52:55,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 93 transitions, 481 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 19:52:55,366 INFO L231 Difference]: Finished difference. Result has 76 places, 67 transitions, 281 flow [2023-08-29 19:52:55,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=281, PETRI_PLACES=76, PETRI_TRANSITIONS=67} [2023-08-29 19:52:55,366 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 14 predicate places. [2023-08-29 19:52:55,367 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 67 transitions, 281 flow [2023-08-29 19:52:55,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:55,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:52:55,367 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-29 19:52:55,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2023-08-29 19:52:55,367 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 15 more)] === [2023-08-29 19:52:55,368 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:52:55,368 INFO L85 PathProgramCache]: Analyzing trace with hash -93788512, now seen corresponding path program 2 times [2023-08-29 19:52:55,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:52:55,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54581565] [2023-08-29 19:52:55,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:52:55,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:52:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:52:55,397 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 19:52:55,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:52:55,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54581565] [2023-08-29 19:52:55,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54581565] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:52:55,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36476664] [2023-08-29 19:52:55,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 19:52:55,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:52:55,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:52:55,398 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 19:52:55,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-08-29 19:52:55,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 19:52:55,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:52:55,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 19:52:55,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:52:55,494 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 19:52:55,495 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:52:55,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36476664] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:52:55,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 19:52:55,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-29 19:52:55,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033049965] [2023-08-29 19:52:55,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:52:55,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:52:55,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:52:55,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:52:55,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:52:55,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 445 [2023-08-29 19:52:55,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 67 transitions, 281 flow. Second operand has 5 states, 5 states have (on average 191.8) internal successors, (959), 5 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:52:55,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:52:55,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 445 [2023-08-29 19:52:55,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:53:00,973 INFO L130 PetriNetUnfolder]: 46770/74901 cut-off events. [2023-08-29 19:53:00,974 INFO L131 PetriNetUnfolder]: For 36021/40284 co-relation queries the response was YES. [2023-08-29 19:53:01,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178012 conditions, 74901 events. 46770/74901 cut-off events. For 36021/40284 co-relation queries the response was YES. Maximal size of possible extension queue 3843. Compared 681550 event pairs, 2407 based on Foata normal form. 1257/68148 useless extension candidates. Maximal degree in co-relation 177996. Up to 43463 conditions per place. [2023-08-29 19:53:01,506 INFO L137 encePairwiseOnDemand]: 441/445 looper letters, 103 selfloop transitions, 4 changer transitions 0/138 dead transitions. [2023-08-29 19:53:01,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 138 transitions, 748 flow [2023-08-29 19:53:01,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 19:53:01,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 19:53:01,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1035 transitions. [2023-08-29 19:53:01,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4651685393258427 [2023-08-29 19:53:01,508 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1035 transitions. [2023-08-29 19:53:01,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1035 transitions. [2023-08-29 19:53:01,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:53:01,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1035 transitions. [2023-08-29 19:53:01,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:53:01,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 445.0) internal successors, (2670), 6 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:53:01,511 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 445.0) internal successors, (2670), 6 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:53:01,511 INFO L175 Difference]: Start difference. First operand has 76 places, 67 transitions, 281 flow. Second operand 5 states and 1035 transitions. [2023-08-29 19:53:01,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 138 transitions, 748 flow [2023-08-29 19:53:01,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 138 transitions, 722 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 19:53:01,684 INFO L231 Difference]: Finished difference. Result has 77 places, 66 transitions, 266 flow [2023-08-29 19:53:01,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=266, PETRI_PLACES=77, PETRI_TRANSITIONS=66} [2023-08-29 19:53:01,685 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 15 predicate places. [2023-08-29 19:53:01,685 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 66 transitions, 266 flow [2023-08-29 19:53:01,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 191.8) internal successors, (959), 5 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:53:01,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:53:01,686 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:53:01,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-08-29 19:53:01,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2023-08-29 19:53:01,891 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 15 more)] === [2023-08-29 19:53:01,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:53:01,891 INFO L85 PathProgramCache]: Analyzing trace with hash -698624120, now seen corresponding path program 1 times [2023-08-29 19:53:01,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:53:01,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382040026] [2023-08-29 19:53:01,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:53:01,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:53:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:53:01,964 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-29 19:53:01,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:53:01,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382040026] [2023-08-29 19:53:01,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382040026] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:53:01,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:53:01,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:53:01,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237855772] [2023-08-29 19:53:01,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:53:01,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:53:01,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:53:01,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:53:01,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:53:02,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 445 [2023-08-29 19:53:02,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 66 transitions, 266 flow. Second operand has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:53:02,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:53:02,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 445 [2023-08-29 19:53:02,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:53:08,750 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [210#true, thr1Thread1of4ForFork0InUse, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 17#L714-1true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:08,750 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-29 19:53:08,750 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:53:08,750 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:08,750 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:08,843 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [18#thr1EXITtrue, 210#true, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:08,843 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-29 19:53:08,843 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:08,844 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:53:08,844 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:09,524 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [210#true, 86#thr1EXITtrue, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 17#L714-1true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:09,524 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 19:53:09,524 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:09,524 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:09,525 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:09,608 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:09,608 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 19:53:09,609 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:09,609 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:09,609 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:09,610 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:09,610 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 19:53:09,610 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:09,610 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:09,610 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:09,618 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [18#thr1EXITtrue, 210#true, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:09,618 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 19:53:09,618 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:53:09,618 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:09,618 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:53:09,618 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:09,983 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:09,983 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:53:09,983 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:09,983 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:09,983 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:09,999 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [210#true, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 17#L714-1true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:09,999 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:53:09,999 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:09,999 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:09,999 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:09,999 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 17#L714-1true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:09,999 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:53:09,999 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:09,999 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:09,999 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,012 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:10,012 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:53:10,012 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:10,012 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,012 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,015 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:10,015 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:53:10,015 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:10,015 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,015 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,018 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [18#thr1EXITtrue, 210#true, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:10,018 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:53:10,018 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:10,019 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:10,019 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:10,022 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:10,022 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:53:10,022 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:10,022 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:10,022 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:10,022 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:10,093 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [210#true, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 17#L714-1true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:10,093 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,093 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,093 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:10,093 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:10,186 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [18#thr1EXITtrue, 210#true, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:10,186 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,186 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:10,186 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,186 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:10,559 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [18#thr1EXITtrue, 210#true, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:10,559 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,559 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:10,559 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:10,559 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,580 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:10,580 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,580 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:10,581 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,581 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:10,587 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:10,588 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,588 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,588 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:10,588 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:10,602 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 17#L714-1true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:10,603 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:53:10,603 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:10,603 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,603 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,603 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [210#true, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 17#L714-1true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:10,603 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,603 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:10,603 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:10,603 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,611 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:10,612 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,612 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:10,612 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,612 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:10,615 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:10,615 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,616 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:10,616 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,616 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:10,676 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [210#true, 86#thr1EXITtrue, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 17#L714-1true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:10,676 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:53:10,676 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:10,677 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:10,677 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:10,746 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:10,746 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:53:10,747 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:10,747 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:10,747 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:10,748 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:10,748 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:53:10,748 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:10,748 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:10,748 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:10,750 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:10,750 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:53:10,750 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:10,750 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:10,750 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:10,757 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [18#thr1EXITtrue, 210#true, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:10,757 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:53:10,757 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:10,757 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,757 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,757 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:10,815 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:10,815 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:53:10,816 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,816 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:10,816 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,820 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:10,821 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:53:10,821 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,821 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:10,821 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,835 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:10,835 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:53:10,835 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,835 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:10,836 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:10,930 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [18#thr1EXITtrue, 210#true, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:10,930 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:53:10,930 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:10,930 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:10,931 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:10,946 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [210#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 17#L714-1true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:10,946 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:53:10,946 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:10,946 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:10,946 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:10,946 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 17#L714-1true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:10,946 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:53:10,946 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:10,946 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:10,946 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:10,958 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:10,959 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:53:10,959 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:10,959 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:10,959 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:10,964 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [18#thr1EXITtrue, 210#true, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:10,964 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:53:10,964 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:10,964 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:10,965 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:10,967 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:10,967 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:53:10,967 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:10,967 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:10,967 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:10,967 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:11,002 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:11,002 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:53:11,002 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:11,002 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:11,002 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:11,050 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [18#thr1EXITtrue, 210#true, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:11,050 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:53:11,050 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:11,050 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:11,051 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:11,066 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:11,066 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:53:11,066 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:11,066 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:11,066 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:11,072 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:11,072 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:53:11,072 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:11,072 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:11,072 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:11,083 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 17#L714-1true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:11,083 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:53:11,083 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:11,083 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:11,083 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:11,084 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [210#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 17#L714-1true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:11,084 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:53:11,084 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:11,084 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:11,084 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:11,092 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:11,092 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:53:11,092 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:11,092 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:11,092 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:11,095 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:11,095 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:53:11,095 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:11,095 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:11,095 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:11,141 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [18#thr1EXITtrue, 210#true, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:11,141 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:53:11,142 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:11,142 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:11,142 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:11,144 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 538#(and (= (mod (+ |thr1Thread3of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:11,144 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:53:11,144 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:11,144 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:11,145 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:11,156 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:11,156 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:53:11,156 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:11,156 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:11,156 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:11,192 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:11,192 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 19:53:11,192 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:11,192 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:53:11,192 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:11,224 INFO L130 PetriNetUnfolder]: 77510/122126 cut-off events. [2023-08-29 19:53:11,224 INFO L131 PetriNetUnfolder]: For 73988/81248 co-relation queries the response was YES. [2023-08-29 19:53:11,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294628 conditions, 122126 events. 77510/122126 cut-off events. For 73988/81248 co-relation queries the response was YES. Maximal size of possible extension queue 6288. Compared 1136920 event pairs, 35370 based on Foata normal form. 245/107580 useless extension candidates. Maximal degree in co-relation 294612. Up to 57655 conditions per place. [2023-08-29 19:53:12,416 INFO L137 encePairwiseOnDemand]: 441/445 looper letters, 60 selfloop transitions, 3 changer transitions 0/94 dead transitions. [2023-08-29 19:53:12,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 94 transitions, 503 flow [2023-08-29 19:53:12,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:53:12,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:53:12,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 804 transitions. [2023-08-29 19:53:12,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.451685393258427 [2023-08-29 19:53:12,417 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 804 transitions. [2023-08-29 19:53:12,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 804 transitions. [2023-08-29 19:53:12,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:53:12,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 804 transitions. [2023-08-29 19:53:12,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:53:12,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 445.0) internal successors, (2225), 5 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:53:12,419 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 445.0) internal successors, (2225), 5 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:53:12,419 INFO L175 Difference]: Start difference. First operand has 77 places, 66 transitions, 266 flow. Second operand 4 states and 804 transitions. [2023-08-29 19:53:12,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 94 transitions, 503 flow [2023-08-29 19:53:12,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 94 transitions, 481 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-29 19:53:12,494 INFO L231 Difference]: Finished difference. Result has 78 places, 67 transitions, 269 flow [2023-08-29 19:53:12,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=269, PETRI_PLACES=78, PETRI_TRANSITIONS=67} [2023-08-29 19:53:12,495 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 16 predicate places. [2023-08-29 19:53:12,495 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 67 transitions, 269 flow [2023-08-29 19:53:12,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:53:12,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:53:12,495 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:53:12,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2023-08-29 19:53:12,495 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 15 more)] === [2023-08-29 19:53:12,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:53:12,496 INFO L85 PathProgramCache]: Analyzing trace with hash -182503894, now seen corresponding path program 1 times [2023-08-29 19:53:12,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:53:12,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972772747] [2023-08-29 19:53:12,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:53:12,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:53:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:53:12,631 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-29 19:53:12,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:53:12,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972772747] [2023-08-29 19:53:12,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972772747] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:53:12,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545427982] [2023-08-29 19:53:12,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:53:12,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:53:12,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:53:12,633 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 19:53:12,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-08-29 19:53:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:53:12,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-29 19:53:12,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:53:12,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:53:12,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:53:12,860 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-29 19:53:12,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:53:12,946 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-29 19:53:12,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545427982] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:53:12,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:53:12,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2023-08-29 19:53:12,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566638286] [2023-08-29 19:53:12,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:53:12,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 19:53:12,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:53:12,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 19:53:12,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-08-29 19:53:13,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 445 [2023-08-29 19:53:13,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 67 transitions, 269 flow. Second operand has 11 states, 11 states have (on average 190.45454545454547) internal successors, (2095), 11 states have internal predecessors, (2095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:53:13,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:53:13,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 445 [2023-08-29 19:53:13,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:53:22,378 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][97], [210#true, thr1Thread1of4ForFork0InUse, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 721#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 6) (<= 0 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (mod |thr1Thread4of4ForFork0_findMax_~i~0#1| 2) 0)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 17#L714-1true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:22,378 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-29 19:53:22,378 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:22,378 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:53:22,378 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:22,787 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][97], [18#thr1EXITtrue, 210#true, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 721#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 6) (<= 0 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (mod |thr1Thread4of4ForFork0_findMax_~i~0#1| 2) 0)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:22,788 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-29 19:53:22,788 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:22,788 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:53:22,788 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:23,491 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][97], [210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 721#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 6) (<= 0 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (mod |thr1Thread4of4ForFork0_findMax_~i~0#1| 2) 0)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 17#L714-1true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:23,492 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 19:53:23,492 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:23,492 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:23,492 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:23,493 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][121], [723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), 210#true, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 17#L714-1true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:23,493 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 19:53:23,493 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:23,493 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:23,494 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:23,909 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][97], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 721#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 6) (<= 0 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (mod |thr1Thread4of4ForFork0_findMax_~i~0#1| 2) 0)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:23,910 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 19:53:23,910 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:23,910 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:23,910 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:23,912 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][121], [723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), 18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:23,912 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 19:53:23,912 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:23,912 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:23,912 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:23,924 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][97], [18#thr1EXITtrue, 210#true, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 721#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 6) (<= 0 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (mod |thr1Thread4of4ForFork0_findMax_~i~0#1| 2) 0)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:23,924 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 19:53:23,924 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:23,924 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:53:23,924 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:23,924 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:53:24,537 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][121], [723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 17#L714-1true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:24,537 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:53:24,537 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:24,537 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:24,537 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:24,538 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][145], [210#true, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 17#L714-1true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|))]) [2023-08-29 19:53:24,538 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:53:24,538 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:24,538 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:24,538 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:24,584 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][97], [18#thr1EXITtrue, 210#true, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 721#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 6) (<= 0 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (mod |thr1Thread4of4ForFork0_findMax_~i~0#1| 2) 0)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:24,584 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:53:24,584 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:24,584 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:24,585 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:24,951 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][121], [723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), 18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:24,952 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:53:24,952 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:24,953 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:24,953 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:24,953 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][145], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|))]) [2023-08-29 19:53:24,953 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:53:24,954 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:24,954 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:24,954 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:24,967 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][97], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 721#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 6) (<= 0 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (mod |thr1Thread4of4ForFork0_findMax_~i~0#1| 2) 0)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:24,968 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:53:24,968 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:24,968 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:24,968 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:24,968 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:24,970 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][121], [723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), 18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:24,970 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:53:24,970 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:24,970 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:53:24,970 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:24,970 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:25,107 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][97], [210#true, thr1Thread1of4ForFork0InUse, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 721#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 6) (<= 0 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (mod |thr1Thread4of4ForFork0_findMax_~i~0#1| 2) 0)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 17#L714-1true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:25,108 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:53:25,108 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:25,108 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:25,108 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:25,262 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][97], [18#thr1EXITtrue, 210#true, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 721#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 6) (<= 0 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (mod |thr1Thread4of4ForFork0_findMax_~i~0#1| 2) 0)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:25,262 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:53:25,262 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:25,262 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:25,262 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:25,489 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][97], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 721#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 6) (<= 0 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (mod |thr1Thread4of4ForFork0_findMax_~i~0#1| 2) 0)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:25,489 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:53:25,489 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:25,489 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:25,489 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:25,503 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][145], [210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 17#L714-1true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|))]) [2023-08-29 19:53:25,503 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:53:25,503 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:25,504 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:25,504 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:25,504 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][159], [210#true, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 17#L714-1true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:25,504 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:53:25,504 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:25,504 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:25,504 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:25,538 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][97], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 721#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 6) (<= 0 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (mod |thr1Thread4of4ForFork0_findMax_~i~0#1| 2) 0)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:25,539 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:53:25,539 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:25,539 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:25,539 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:25,542 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][121], [723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), 18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, 4#L718true, 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:25,542 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:53:25,542 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:25,542 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:25,542 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:25,588 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][145], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|))]) [2023-08-29 19:53:25,589 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:53:25,589 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:25,589 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:25,589 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:25,589 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][159], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:25,589 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:53:25,589 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:25,589 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:25,589 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:25,598 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][121], [723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), 18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:25,598 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:53:25,598 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:25,598 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:25,598 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:25,598 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:25,599 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][145], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:25,599 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:53:25,599 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:25,599 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:25,599 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:25,599 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:53:25,704 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][97], [210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 721#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 6) (<= 0 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (mod |thr1Thread4of4ForFork0_findMax_~i~0#1| 2) 0)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 17#L714-1true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:25,704 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:53:25,704 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:25,705 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:25,705 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:25,705 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][121], [723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), 210#true, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 17#L714-1true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:25,705 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:53:25,705 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:25,706 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:25,706 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,151 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][97], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 721#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 6) (<= 0 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (mod |thr1Thread4of4ForFork0_findMax_~i~0#1| 2) 0)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:26,151 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,151 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,151 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,151 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,153 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][121], [723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), 18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:26,153 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,153 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,153 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,153 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,165 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][97], [18#thr1EXITtrue, 210#true, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 721#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 6) (<= 0 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (mod |thr1Thread4of4ForFork0_findMax_~i~0#1| 2) 0)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:26,165 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,165 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,165 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:26,165 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,165 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:26,325 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][97], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 721#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 6) (<= 0 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (mod |thr1Thread4of4ForFork0_findMax_~i~0#1| 2) 0)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:26,325 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,326 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:26,326 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,326 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:26,328 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][121], [723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), 18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:26,328 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,328 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:26,328 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:26,329 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,336 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][159], [210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 17#L714-1true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:26,336 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,336 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,336 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,336 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,337 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [210#true, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 17#L714-1true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:26,337 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,337 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,337 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,337 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,365 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][121], [723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), 18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:26,365 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,365 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:26,365 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,365 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:26,365 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][145], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, 4#L718true, 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|))]) [2023-08-29 19:53:26,365 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,366 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:26,366 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,366 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:26,395 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][159], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:26,395 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,395 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,395 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,395 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,396 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:26,396 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,396 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,396 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,396 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,402 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][145], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:26,402 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,402 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:26,402 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,402 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,402 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:26,402 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][159], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:26,402 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,402 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,402 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,402 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:26,403 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:53:26,518 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][121], [723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 17#L714-1true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:26,518 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,518 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,518 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:26,518 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:26,519 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][145], [210#true, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 17#L714-1true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:26,519 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,519 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:26,519 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:26,519 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,563 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][97], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 721#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 6) (<= 0 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (mod |thr1Thread4of4ForFork0_findMax_~i~0#1| 2) 0)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:26,563 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,563 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,563 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,563 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,629 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][121], [723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), 18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:26,629 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,629 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:26,629 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,629 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:26,630 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][145], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|))]) [2023-08-29 19:53:26,630 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,630 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,630 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:26,630 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:26,641 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][97], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 721#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 6) (<= 0 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (mod |thr1Thread4of4ForFork0_findMax_~i~0#1| 2) 0)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:26,641 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,641 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,641 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,641 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,641 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,642 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][121], [723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), 18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:26,642 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,642 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,642 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,642 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,642 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,739 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][121], [723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), 18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:26,739 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,739 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,739 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,739 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,740 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][145], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|))]) [2023-08-29 19:53:26,740 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,740 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,740 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,740 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,744 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 17#L714-1true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:26,744 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,744 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:26,744 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,744 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:26,762 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][145], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:26,762 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,763 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,763 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,763 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,763 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][159], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, 4#L718true, 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:26,763 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,763 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,763 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,763 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,782 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:26,782 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,782 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,782 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:26,782 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:26,785 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][159], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:26,785 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,785 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,785 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,786 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,786 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:53:26,843 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][97], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 721#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 6) (<= 0 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (mod |thr1Thread4of4ForFork0_findMax_~i~0#1| 2) 0)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:26,843 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:53:26,843 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:26,843 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,843 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:26,857 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][145], [210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 17#L714-1true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:26,857 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:53:26,857 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:26,858 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:26,858 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:26,858 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][159], [210#true, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 17#L714-1true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:26,858 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:53:26,858 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:26,858 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:26,858 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,175 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][97], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 721#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 6) (<= 0 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (mod |thr1Thread4of4ForFork0_findMax_~i~0#1| 2) 0)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:27,176 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,176 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:27,176 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,176 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:27,180 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][121], [723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), 18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, 4#L718true, 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:27,192 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,192 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:27,192 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:27,192 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,254 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][145], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|))]) [2023-08-29 19:53:27,254 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,254 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,254 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,254 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,255 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][159], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:27,255 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,255 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,255 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,255 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,263 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][121], [723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), 18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:27,263 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,263 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,263 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:27,263 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:27,263 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,264 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][145], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|))]) [2023-08-29 19:53:27,264 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,264 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:27,264 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,264 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,264 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:27,323 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][145], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:27,323 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,323 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:27,323 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:27,323 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,324 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][159], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:27,324 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,324 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:27,324 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:27,324 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,336 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][159], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:27,336 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,336 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:27,336 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:53:27,336 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,394 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][97], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 721#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 6) (<= 0 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (mod |thr1Thread4of4ForFork0_findMax_~i~0#1| 2) 0)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:27,394 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,394 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,394 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,394 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,396 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][121], [723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), 18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:27,396 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,396 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,396 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,396 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,403 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [210#true, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 17#L714-1true, 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:27,403 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 19:53:27,403 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,403 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,403 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:53:27,404 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][159], [210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 17#L714-1true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:27,404 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,405 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:53:27,405 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:53:27,405 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,430 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][121], [723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), 18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:27,430 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,430 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,430 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,431 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,431 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][145], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, 4#L718true, 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:27,431 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,431 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,431 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,431 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,449 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [86#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 17#L714-1true, 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:27,450 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 19:53:27,450 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:53:27,450 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:53:27,450 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:53:27,459 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:27,459 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 19:53:27,459 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,459 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:53:27,460 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,463 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][159], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:27,463 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,463 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:53:27,463 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:53:27,463 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,465 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:27,465 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 19:53:27,465 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:53:27,465 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:53:27,465 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:53:27,469 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][145], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|))]) [2023-08-29 19:53:27,470 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,470 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,470 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,470 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,470 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,470 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][159], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:27,470 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,470 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,470 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,470 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,470 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,501 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][159], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:27,501 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,501 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,501 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,501 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:53:27,549 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][121], [723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), 18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:27,549 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 19:53:27,549 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,549 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,549 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:53:27,550 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][145], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:27,550 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 19:53:27,550 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,550 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,550 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:53:27,571 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][145], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:27,571 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 19:53:27,571 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,571 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:53:27,571 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,571 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][159], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, 4#L718true, 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:27,571 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 19:53:27,571 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,571 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:53:27,572 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,592 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][159], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:27,592 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 19:53:27,592 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:53:27,592 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:53:27,592 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,592 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:53:27,635 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][145], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|))]) [2023-08-29 19:53:27,636 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 19:53:27,636 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:53:27,636 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:53:27,636 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:53:27,636 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][159], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:27,636 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 19:53:27,636 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:53:27,636 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:53:27,636 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:53:27,648 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][159], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:27,649 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 19:53:27,649 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:53:27,649 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:53:27,649 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:53:27,679 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][159], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 599#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:53:27,680 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 19:53:27,680 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:53:27,680 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:53:27,680 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:53:27,709 INFO L130 PetriNetUnfolder]: 114965/180156 cut-off events. [2023-08-29 19:53:27,709 INFO L131 PetriNetUnfolder]: For 86446/97003 co-relation queries the response was YES. [2023-08-29 19:53:28,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436033 conditions, 180156 events. 114965/180156 cut-off events. For 86446/97003 co-relation queries the response was YES. Maximal size of possible extension queue 9032. Compared 1725610 event pairs, 20959 based on Foata normal form. 388/164966 useless extension candidates. Maximal degree in co-relation 436016. Up to 34041 conditions per place. [2023-08-29 19:53:29,441 INFO L137 encePairwiseOnDemand]: 441/445 looper letters, 141 selfloop transitions, 7 changer transitions 0/179 dead transitions. [2023-08-29 19:53:29,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 179 transitions, 973 flow [2023-08-29 19:53:29,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 19:53:29,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 19:53:29,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1426 transitions. [2023-08-29 19:53:29,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45778491171749597 [2023-08-29 19:53:29,443 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1426 transitions. [2023-08-29 19:53:29,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1426 transitions. [2023-08-29 19:53:29,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:53:29,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1426 transitions. [2023-08-29 19:53:29,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 203.71428571428572) internal successors, (1426), 7 states have internal predecessors, (1426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:53:29,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 445.0) internal successors, (3560), 8 states have internal predecessors, (3560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:53:29,445 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 445.0) internal successors, (3560), 8 states have internal predecessors, (3560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:53:29,445 INFO L175 Difference]: Start difference. First operand has 78 places, 67 transitions, 269 flow. Second operand 7 states and 1426 transitions. [2023-08-29 19:53:29,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 179 transitions, 973 flow [2023-08-29 19:53:29,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 179 transitions, 969 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:53:29,756 INFO L231 Difference]: Finished difference. Result has 85 places, 71 transitions, 311 flow [2023-08-29 19:53:29,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=311, PETRI_PLACES=85, PETRI_TRANSITIONS=71} [2023-08-29 19:53:29,757 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 23 predicate places. [2023-08-29 19:53:29,757 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 71 transitions, 311 flow [2023-08-29 19:53:29,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 190.45454545454547) internal successors, (2095), 11 states have internal predecessors, (2095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:53:29,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:53:29,758 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:53:29,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-08-29 19:53:29,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:53:29,958 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 15 more)] === [2023-08-29 19:53:29,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:53:29,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1860604265, now seen corresponding path program 1 times [2023-08-29 19:53:29,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:53:29,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12440784] [2023-08-29 19:53:29,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:53:29,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:53:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:53:29,973 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-29 19:53:29,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:53:29,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12440784] [2023-08-29 19:53:29,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12440784] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:53:29,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:53:29,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:53:29,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96229325] [2023-08-29 19:53:29,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:53:29,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:53:29,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:53:29,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:53:29,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:53:29,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 445 [2023-08-29 19:53:30,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 71 transitions, 311 flow. Second operand has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:53:30,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:53:30,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 445 [2023-08-29 19:53:30,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:54:02,168 INFO L130 PetriNetUnfolder]: 250931/368240 cut-off events. [2023-08-29 19:54:02,168 INFO L131 PetriNetUnfolder]: For 261860/269931 co-relation queries the response was YES. [2023-08-29 19:54:03,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 961433 conditions, 368240 events. 250931/368240 cut-off events. For 261860/269931 co-relation queries the response was YES. Maximal size of possible extension queue 17260. Compared 3394979 event pairs, 124780 based on Foata normal form. 0/346453 useless extension candidates. Maximal degree in co-relation 961413. Up to 226603 conditions per place. [2023-08-29 19:54:05,374 INFO L137 encePairwiseOnDemand]: 438/445 looper letters, 80 selfloop transitions, 14 changer transitions 0/110 dead transitions. [2023-08-29 19:54:05,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 110 transitions, 689 flow [2023-08-29 19:54:05,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:54:05,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:54:05,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 613 transitions. [2023-08-29 19:54:05,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4591760299625468 [2023-08-29 19:54:05,375 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 613 transitions. [2023-08-29 19:54:05,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 613 transitions. [2023-08-29 19:54:05,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:54:05,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 613 transitions. [2023-08-29 19:54:05,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:54:05,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 445.0) internal successors, (1780), 4 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:54:05,377 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 445.0) internal successors, (1780), 4 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:54:05,377 INFO L175 Difference]: Start difference. First operand has 85 places, 71 transitions, 311 flow. Second operand 3 states and 613 transitions. [2023-08-29 19:54:05,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 110 transitions, 689 flow [2023-08-29 19:54:06,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 110 transitions, 668 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-29 19:54:06,506 INFO L231 Difference]: Finished difference. Result has 87 places, 80 transitions, 426 flow [2023-08-29 19:54:06,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=87, PETRI_TRANSITIONS=80} [2023-08-29 19:54:06,507 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 25 predicate places. [2023-08-29 19:54:06,507 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 80 transitions, 426 flow [2023-08-29 19:54:06,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:54:06,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:54:06,507 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:54:06,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2023-08-29 19:54:06,507 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 15 more)] === [2023-08-29 19:54:06,507 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:54:06,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1362646072, now seen corresponding path program 2 times [2023-08-29 19:54:06,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:54:06,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676533023] [2023-08-29 19:54:06,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:54:06,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:54:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:54:06,674 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-29 19:54:06,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:54:06,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676533023] [2023-08-29 19:54:06,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676533023] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:54:06,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:54:06,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 19:54:06,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277047883] [2023-08-29 19:54:06,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:54:06,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:54:06,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:54:06,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:54:06,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:54:06,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 445 [2023-08-29 19:54:06,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 80 transitions, 426 flow. Second operand has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:54:06,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:54:06,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 445 [2023-08-29 19:54:06,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:54:15,334 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1709] L714-1-->L718: Formula: (and (not (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|, ~m~0=v_~m~0_26, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1, ~m~0, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1][108], [18#thr1EXITtrue, 170#L714-1true, 210#true, thr1Thread1of4ForFork0InUse, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread2of4ForFork0InUse, Black: 392#true, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), Black: 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 732#true, Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:54:15,335 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 19:54:15,335 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:54:15,335 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:54:15,335 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:54:15,470 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][116], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), Black: 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 732#true, 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:54:15,470 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 19:54:15,470 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:54:15,470 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:54:15,470 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 19:54:16,271 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1709] L714-1-->L718: Formula: (and (not (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|, ~m~0=v_~m~0_26, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1, ~m~0, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1][108], [18#thr1EXITtrue, 170#L714-1true, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread2of4ForFork0InUse, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), Black: 392#true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), Black: 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 732#true, Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:54:16,272 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:54:16,272 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:54:16,272 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:54:16,272 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:54:16,272 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1709] L714-1-->L718: Formula: (and (not (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|, ~m~0=v_~m~0_26, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1, ~m~0, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1][108], [723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), 170#L714-1true, 18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 392#true, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 732#true, Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:54:16,273 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:54:16,273 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:54:16,273 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:54:16,273 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:54:16,382 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][116], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), Black: 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 732#true, Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:54:16,382 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:54:16,382 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:54:16,382 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:54:16,382 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:54:16,382 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][116], [723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), 18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 732#true, 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:54:16,383 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 19:54:16,383 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:54:16,383 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:54:16,383 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 19:54:16,809 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1709] L714-1-->L718: Formula: (and (not (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|, ~m~0=v_~m~0_26, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1, ~m~0, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1][108], [723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), 170#L714-1true, 18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), Black: 392#true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 732#true, Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:54:16,810 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:54:16,810 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:54:16,810 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:54:16,810 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:54:16,810 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1709] L714-1-->L718: Formula: (and (not (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|, ~m~0=v_~m~0_26, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1, ~m~0, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1][108], [170#L714-1true, 18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), Black: 392#true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), Black: 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 732#true, Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|))]) [2023-08-29 19:54:16,810 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:54:16,810 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:54:16,810 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:54:16,810 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:54:17,185 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][116], [723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), 18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 732#true, Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:54:17,186 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:54:17,186 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:54:17,186 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:54:17,186 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:54:17,186 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][116], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), Black: 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 732#true, Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|))]) [2023-08-29 19:54:17,186 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 19:54:17,187 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:54:17,187 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 19:54:17,187 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:54:17,275 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1709] L714-1-->L718: Formula: (and (not (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|, ~m~0=v_~m~0_26, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1, ~m~0, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1][108], [18#thr1EXITtrue, 170#L714-1true, 210#true, thr1Thread1of4ForFork0InUse, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread2of4ForFork0InUse, Black: 392#true, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), Black: 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 732#true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:54:17,276 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:54:17,276 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:54:17,276 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:54:17,276 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:54:17,414 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][116], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), Black: 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 732#true, Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:54:17,414 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:54:17,414 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:54:17,414 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:54:17,414 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:54:17,524 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1709] L714-1-->L718: Formula: (and (not (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|, ~m~0=v_~m~0_26, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1, ~m~0, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1][108], [170#L714-1true, 18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), Black: 392#true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), Black: 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 732#true, Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|))]) [2023-08-29 19:54:17,524 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:54:17,524 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:54:17,524 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:54:17,524 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:54:17,586 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][116], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), Black: 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 732#true, Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|))]) [2023-08-29 19:54:17,586 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 19:54:17,586 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:54:17,586 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 19:54:17,586 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:54:17,651 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1709] L714-1-->L718: Formula: (and (not (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|, ~m~0=v_~m~0_26, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1, ~m~0, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1][108], [18#thr1EXITtrue, 170#L714-1true, 86#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread2of4ForFork0InUse, Black: 392#true, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), Black: 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 732#true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:54:17,652 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:54:17,652 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:54:17,652 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:54:17,652 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:54:17,652 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1709] L714-1-->L718: Formula: (and (not (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|, ~m~0=v_~m~0_26, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1, ~m~0, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1][108], [723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), 170#L714-1true, 18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), Black: 392#true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 732#true, Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:54:17,652 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:54:17,652 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:54:17,652 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:54:17,652 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:54:17,763 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][116], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), Black: 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 732#true, Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:54:17,763 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:54:17,763 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:54:17,764 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:54:17,764 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:54:17,764 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][116], [723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), 18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread2of4ForFork0InUse, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 732#true, 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:54:17,764 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:54:17,764 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:54:17,764 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:54:17,764 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:54:17,908 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1709] L714-1-->L718: Formula: (and (not (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|, ~m~0=v_~m~0_26, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1, ~m~0, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1][108], [723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), 170#L714-1true, 18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 392#true, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 732#true, Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:54:17,908 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:54:17,908 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:54:17,908 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:54:17,909 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:54:17,909 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1709] L714-1-->L718: Formula: (and (not (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|, ~m~0=v_~m~0_26, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1, ~m~0, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1][108], [170#L714-1true, 18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 392#true, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), Black: 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 732#true, Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:54:17,909 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:54:17,909 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:54:17,909 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:54:17,909 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:54:17,991 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][116], [723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), 18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 732#true, 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:54:17,991 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:54:17,991 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:54:17,991 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:54:17,991 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:54:17,991 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][116], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), Black: 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 732#true, Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 4#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:54:17,991 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:54:17,992 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:54:17,992 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:54:17,992 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:54:18,367 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1709] L714-1-->L718: Formula: (and (not (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|, ~m~0=v_~m~0_26, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1, ~m~0, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1][108], [170#L714-1true, 18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), Black: 392#true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), Black: 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 116#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 732#true, Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:54:18,367 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:54:18,368 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:54:18,368 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:54:18,368 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:54:18,422 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][116], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 723#(and (= |~#storage~0.offset| 0) (<= 1 |thr1Thread4of4ForFork0_findMax_~i~0#1|) (= (select |#length| |~#storage~0.base|) 24) (< |thr1Thread4of4ForFork0_findMax_~i~0#1| 7) (= 3 |~#storage~0.base|) (= (mod (+ |thr1Thread4of4ForFork0_findMax_~i~0#1| 1) 2) 0)), Black: 719#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 602#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 732#true, Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:54:18,422 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:54:18,423 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:54:18,423 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:54:18,423 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:54:18,528 INFO L130 PetriNetUnfolder]: 92152/147570 cut-off events. [2023-08-29 19:54:18,528 INFO L131 PetriNetUnfolder]: For 112967/133744 co-relation queries the response was YES. [2023-08-29 19:54:19,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376704 conditions, 147570 events. 92152/147570 cut-off events. For 112967/133744 co-relation queries the response was YES. Maximal size of possible extension queue 7936. Compared 1443488 event pairs, 9263 based on Foata normal form. 3640/141024 useless extension candidates. Maximal degree in co-relation 376683. Up to 90195 conditions per place. [2023-08-29 19:54:19,701 INFO L137 encePairwiseOnDemand]: 441/445 looper letters, 108 selfloop transitions, 5 changer transitions 0/152 dead transitions. [2023-08-29 19:54:19,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 152 transitions, 924 flow [2023-08-29 19:54:19,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 19:54:19,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 19:54:19,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1029 transitions. [2023-08-29 19:54:19,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46247191011235955 [2023-08-29 19:54:19,703 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1029 transitions. [2023-08-29 19:54:19,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1029 transitions. [2023-08-29 19:54:19,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:54:19,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1029 transitions. [2023-08-29 19:54:19,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 205.8) internal successors, (1029), 5 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:54:19,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 445.0) internal successors, (2670), 6 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:54:19,706 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 445.0) internal successors, (2670), 6 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:54:19,706 INFO L175 Difference]: Start difference. First operand has 87 places, 80 transitions, 426 flow. Second operand 5 states and 1029 transitions. [2023-08-29 19:54:19,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 152 transitions, 924 flow [2023-08-29 19:54:20,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 152 transitions, 882 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-29 19:54:20,550 INFO L231 Difference]: Finished difference. Result has 83 places, 77 transitions, 374 flow [2023-08-29 19:54:20,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=374, PETRI_PLACES=83, PETRI_TRANSITIONS=77} [2023-08-29 19:54:20,550 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 21 predicate places. [2023-08-29 19:54:20,551 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 77 transitions, 374 flow [2023-08-29 19:54:20,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:54:20,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:54:20,551 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:54:20,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2023-08-29 19:54:20,551 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 15 more)] === [2023-08-29 19:54:20,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:54:20,551 INFO L85 PathProgramCache]: Analyzing trace with hash 832104358, now seen corresponding path program 1 times [2023-08-29 19:54:20,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:54:20,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610276765] [2023-08-29 19:54:20,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:54:20,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:54:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:54:20,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 19:54:20,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:54:20,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610276765] [2023-08-29 19:54:20,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610276765] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:54:20,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279817111] [2023-08-29 19:54:20,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:54:20,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:54:20,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:54:20,581 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 19:54:20,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-08-29 19:54:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:54:20,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 19:54:20,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:54:20,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 19:54:20,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:54:20,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 19:54:20,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279817111] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:54:20,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:54:20,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-29 19:54:20,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618916534] [2023-08-29 19:54:20,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:54:20,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:54:20,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:54:20,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:54:20,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:54:20,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 445 [2023-08-29 19:54:20,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 77 transitions, 374 flow. Second operand has 5 states, 5 states have (on average 192.6) internal successors, (963), 5 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:54:20,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:54:20,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 445 [2023-08-29 19:54:20,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:54:32,301 INFO L130 PetriNetUnfolder]: 89430/140325 cut-off events. [2023-08-29 19:54:32,301 INFO L131 PetriNetUnfolder]: For 85911/103134 co-relation queries the response was YES. [2023-08-29 19:54:32,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356657 conditions, 140325 events. 89430/140325 cut-off events. For 85911/103134 co-relation queries the response was YES. Maximal size of possible extension queue 7224. Compared 1337518 event pairs, 53230 based on Foata normal form. 3137/133952 useless extension candidates. Maximal degree in co-relation 356639. Up to 89523 conditions per place. [2023-08-29 19:54:33,374 INFO L137 encePairwiseOnDemand]: 442/445 looper letters, 90 selfloop transitions, 3 changer transitions 0/132 dead transitions. [2023-08-29 19:54:33,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 132 transitions, 795 flow [2023-08-29 19:54:33,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:54:33,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:54:33,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 826 transitions. [2023-08-29 19:54:33,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4640449438202247 [2023-08-29 19:54:33,375 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 826 transitions. [2023-08-29 19:54:33,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 826 transitions. [2023-08-29 19:54:33,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:54:33,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 826 transitions. [2023-08-29 19:54:33,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 206.5) internal successors, (826), 4 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:54:33,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 445.0) internal successors, (2225), 5 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:54:33,377 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 445.0) internal successors, (2225), 5 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:54:33,377 INFO L175 Difference]: Start difference. First operand has 83 places, 77 transitions, 374 flow. Second operand 4 states and 826 transitions. [2023-08-29 19:54:33,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 132 transitions, 795 flow [2023-08-29 19:54:34,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 132 transitions, 768 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-29 19:54:34,420 INFO L231 Difference]: Finished difference. Result has 83 places, 76 transitions, 366 flow [2023-08-29 19:54:34,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=366, PETRI_PLACES=83, PETRI_TRANSITIONS=76} [2023-08-29 19:54:34,420 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 21 predicate places. [2023-08-29 19:54:34,420 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 76 transitions, 366 flow [2023-08-29 19:54:34,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 192.6) internal successors, (963), 5 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:54:34,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:54:34,420 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:54:34,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-08-29 19:54:34,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:54:34,621 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 15 more)] === [2023-08-29 19:54:34,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:54:34,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1955137186, now seen corresponding path program 2 times [2023-08-29 19:54:34,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:54:34,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996839029] [2023-08-29 19:54:34,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:54:34,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:54:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:54:34,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-29 19:54:34,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:54:34,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996839029] [2023-08-29 19:54:34,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996839029] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:54:34,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556641217] [2023-08-29 19:54:34,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 19:54:34,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:54:34,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:54:34,650 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 19:54:34,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-08-29 19:54:34,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 19:54:34,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:54:34,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 19:54:34,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:54:34,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-29 19:54:34,771 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:54:34,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556641217] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:54:34,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 19:54:34,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2023-08-29 19:54:34,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192037715] [2023-08-29 19:54:34,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:54:34,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:54:34,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:54:34,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:54:34,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 19:54:34,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 445 [2023-08-29 19:54:34,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 76 transitions, 366 flow. Second operand has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:54:34,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:54:34,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 445 [2023-08-29 19:54:34,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:54:52,913 INFO L130 PetriNetUnfolder]: 153683/224840 cut-off events. [2023-08-29 19:54:52,913 INFO L131 PetriNetUnfolder]: For 189164/193139 co-relation queries the response was YES. [2023-08-29 19:54:53,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 611092 conditions, 224840 events. 153683/224840 cut-off events. For 189164/193139 co-relation queries the response was YES. Maximal size of possible extension queue 10108. Compared 1959437 event pairs, 67501 based on Foata normal form. 1210/214837 useless extension candidates. Maximal degree in co-relation 611074. Up to 115162 conditions per place. [2023-08-29 19:54:54,583 INFO L137 encePairwiseOnDemand]: 435/445 looper letters, 147 selfloop transitions, 32 changer transitions 0/192 dead transitions. [2023-08-29 19:54:54,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 192 transitions, 1218 flow [2023-08-29 19:54:54,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:54:54,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:54:54,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1192 transitions. [2023-08-29 19:54:54,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44644194756554306 [2023-08-29 19:54:54,585 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1192 transitions. [2023-08-29 19:54:54,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1192 transitions. [2023-08-29 19:54:54,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:54:54,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1192 transitions. [2023-08-29 19:54:54,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:54:54,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 445.0) internal successors, (3115), 7 states have internal predecessors, (3115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:54:54,588 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 445.0) internal successors, (3115), 7 states have internal predecessors, (3115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:54:54,588 INFO L175 Difference]: Start difference. First operand has 83 places, 76 transitions, 366 flow. Second operand 6 states and 1192 transitions. [2023-08-29 19:54:54,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 192 transitions, 1218 flow [2023-08-29 19:54:54,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 192 transitions, 1206 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 19:54:54,792 INFO L231 Difference]: Finished difference. Result has 89 places, 95 transitions, 622 flow [2023-08-29 19:54:54,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=622, PETRI_PLACES=89, PETRI_TRANSITIONS=95} [2023-08-29 19:54:54,792 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 27 predicate places. [2023-08-29 19:54:54,793 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 95 transitions, 622 flow [2023-08-29 19:54:54,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:54:54,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:54:54,793 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:54:54,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2023-08-29 19:54:54,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable84 [2023-08-29 19:54:54,994 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 15 more)] === [2023-08-29 19:54:54,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:54:54,994 INFO L85 PathProgramCache]: Analyzing trace with hash -470808156, now seen corresponding path program 3 times [2023-08-29 19:54:54,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:54:54,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914081001] [2023-08-29 19:54:54,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:54:54,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:54:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:54:55,021 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-29 19:54:55,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:54:55,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914081001] [2023-08-29 19:54:55,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914081001] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:54:55,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248661380] [2023-08-29 19:54:55,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 19:54:55,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:54:55,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:54:55,023 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 19:54:55,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-08-29 19:54:55,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 19:54:55,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:54:55,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 19:54:55,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:54:55,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-29 19:54:55,134 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:54:55,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248661380] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:54:55,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 19:54:55,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2023-08-29 19:54:55,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351505857] [2023-08-29 19:54:55,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:54:55,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:54:55,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:54:55,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:54:55,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-29 19:54:55,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 445 [2023-08-29 19:54:55,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 95 transitions, 622 flow. Second operand has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:54:55,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:54:55,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 445 [2023-08-29 19:54:55,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:55:21,337 INFO L130 PetriNetUnfolder]: 190233/287028 cut-off events. [2023-08-29 19:55:21,338 INFO L131 PetriNetUnfolder]: For 397730/402176 co-relation queries the response was YES. [2023-08-29 19:55:22,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 824860 conditions, 287028 events. 190233/287028 cut-off events. For 397730/402176 co-relation queries the response was YES. Maximal size of possible extension queue 13663. Compared 2707849 event pairs, 106003 based on Foata normal form. 1454/282015 useless extension candidates. Maximal degree in co-relation 824838. Up to 183598 conditions per place. [2023-08-29 19:55:23,831 INFO L137 encePairwiseOnDemand]: 435/445 looper letters, 178 selfloop transitions, 54 changer transitions 0/245 dead transitions. [2023-08-29 19:55:23,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 245 transitions, 1989 flow [2023-08-29 19:55:23,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:55:23,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:55:23,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1193 transitions. [2023-08-29 19:55:23,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4468164794007491 [2023-08-29 19:55:23,832 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1193 transitions. [2023-08-29 19:55:23,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1193 transitions. [2023-08-29 19:55:23,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:55:23,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1193 transitions. [2023-08-29 19:55:23,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 198.83333333333334) internal successors, (1193), 6 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:23,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 445.0) internal successors, (3115), 7 states have internal predecessors, (3115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:23,835 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 445.0) internal successors, (3115), 7 states have internal predecessors, (3115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:23,835 INFO L175 Difference]: Start difference. First operand has 89 places, 95 transitions, 622 flow. Second operand 6 states and 1193 transitions. [2023-08-29 19:55:23,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 245 transitions, 1989 flow [2023-08-29 19:55:37,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 245 transitions, 1989 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 19:55:37,071 INFO L231 Difference]: Finished difference. Result has 98 places, 145 transitions, 1398 flow [2023-08-29 19:55:37,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1398, PETRI_PLACES=98, PETRI_TRANSITIONS=145} [2023-08-29 19:55:37,071 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 36 predicate places. [2023-08-29 19:55:37,071 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 145 transitions, 1398 flow [2023-08-29 19:55:37,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:37,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:55:37,072 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:55:37,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2023-08-29 19:55:37,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:55:37,272 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 15 more)] === [2023-08-29 19:55:37,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:55:37,272 INFO L85 PathProgramCache]: Analyzing trace with hash 955752692, now seen corresponding path program 1 times [2023-08-29 19:55:37,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:55:37,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867289489] [2023-08-29 19:55:37,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:55:37,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:55:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:55:37,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-29 19:55:37,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:55:37,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867289489] [2023-08-29 19:55:37,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867289489] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:55:37,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270987588] [2023-08-29 19:55:37,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:55:37,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:55:37,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:55:37,304 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 19:55:37,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-08-29 19:55:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:55:37,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 19:55:37,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:55:37,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-29 19:55:37,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:55:37,414 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-29 19:55:37,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270987588] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:55:37,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:55:37,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-29 19:55:37,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640757806] [2023-08-29 19:55:37,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:55:37,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:55:37,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:55:37,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:55:37,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:55:37,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 445 [2023-08-29 19:55:37,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 145 transitions, 1398 flow. Second operand has 5 states, 5 states have (on average 192.6) internal successors, (963), 5 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:37,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:55:37,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 445 [2023-08-29 19:55:37,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:55:50,964 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1888] L718-->thr1EXIT: Formula: (and (= |v_thr1Thread2of4ForFork0_#res#1.offset_9| 0) (= |v_thr1Thread2of4ForFork0_#res#1.base_9| 0) (<= |v_thr1Thread2of4ForFork0_findMax_~my_max~0#1_41| v_~max~0_186)) InVars {~max~0=v_~max~0_186, thr1Thread2of4ForFork0_findMax_~my_max~0#1=|v_thr1Thread2of4ForFork0_findMax_~my_max~0#1_41|} OutVars{thr1Thread2of4ForFork0_#res#1.offset=|v_thr1Thread2of4ForFork0_#res#1.offset_9|, ~max~0=v_~max~0_186, thr1Thread2of4ForFork0_findMax_~my_max~0#1=|v_thr1Thread2of4ForFork0_findMax_~my_max~0#1_41|, thr1Thread2of4ForFork0_#res#1.base=|v_thr1Thread2of4ForFork0_#res#1.base_9|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_#res#1.offset, thr1Thread2of4ForFork0_#res#1.base][96], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 1008#true, thr1Thread2of4ForFork0InUse, Black: 392#true, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 1000#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 923#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0)), Black: 911#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), Black: 541#true, 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 925#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 986#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 998#(and (< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), Black: 976#(< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 907#(<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:55:50,964 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:55:50,964 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:55:50,964 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:55:50,965 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:55:50,965 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1709] L714-1-->L718: Formula: (and (not (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|, ~m~0=v_~m~0_26, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1, ~m~0, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1][16], [210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 1008#true, thr1Thread2of4ForFork0InUse, Black: 392#true, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 1000#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 923#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 911#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 925#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 907#(<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, 108#thr1EXITtrue, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 986#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 998#(and (< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), Black: 976#(< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 116#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 858#true]) [2023-08-29 19:55:50,965 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:55:50,965 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:55:50,965 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:55:50,965 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:55:51,230 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1709] L714-1-->L718: Formula: (and (not (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|, ~m~0=v_~m~0_26, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1, ~m~0, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1][16], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 1008#true, thr1Thread2of4ForFork0InUse, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), 95#L718true, Black: 392#true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 923#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 911#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 907#(<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 986#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 998#(and (< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 976#(< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), Black: 1000#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), 116#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 933#true, 925#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:55:51,231 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:55:51,231 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:55:51,231 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:55:51,231 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:55:51,231 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1895] L718-->thr1EXIT: Formula: (and (<= |v_thr1Thread3of4ForFork0_findMax_~my_max~0#1_39| v_~max~0_190) (= |v_thr1Thread3of4ForFork0_#res#1.base_11| 0) (= |v_thr1Thread3of4ForFork0_#res#1.offset_11| 0)) InVars {thr1Thread3of4ForFork0_findMax_~my_max~0#1=|v_thr1Thread3of4ForFork0_findMax_~my_max~0#1_39|, ~max~0=v_~max~0_190} OutVars{thr1Thread3of4ForFork0_#res#1.offset=|v_thr1Thread3of4ForFork0_#res#1.offset_11|, thr1Thread3of4ForFork0_findMax_~my_max~0#1=|v_thr1Thread3of4ForFork0_findMax_~my_max~0#1_39|, ~max~0=v_~max~0_190, thr1Thread3of4ForFork0_#res#1.base=|v_thr1Thread3of4ForFork0_#res#1.base_11|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_#res#1.offset, thr1Thread3of4ForFork0_#res#1.base][121], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 1008#true, thr1Thread2of4ForFork0InUse, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), Black: 392#true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 732#true, Black: 923#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 911#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), Black: 907#(<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, Black: 986#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 998#(and (< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 976#(< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), Black: 1000#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 933#true, 925#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:55:51,231 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 19:55:51,231 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 19:55:51,231 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:55:51,231 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:55:52,399 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][60], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 1008#true, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 923#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0)), Black: 732#true, 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 925#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), Black: 907#(<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0), 911#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 986#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 998#(and (< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 976#(< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), Black: 1000#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), 116#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 933#true, Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:55:52,400 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 19:55:52,400 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:55:52,400 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:55:52,400 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 19:55:52,953 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1888] L718-->thr1EXIT: Formula: (and (= |v_thr1Thread2of4ForFork0_#res#1.offset_9| 0) (= |v_thr1Thread2of4ForFork0_#res#1.base_9| 0) (<= |v_thr1Thread2of4ForFork0_findMax_~my_max~0#1_41| v_~max~0_186)) InVars {~max~0=v_~max~0_186, thr1Thread2of4ForFork0_findMax_~my_max~0#1=|v_thr1Thread2of4ForFork0_findMax_~my_max~0#1_41|} OutVars{thr1Thread2of4ForFork0_#res#1.offset=|v_thr1Thread2of4ForFork0_#res#1.offset_9|, ~max~0=v_~max~0_186, thr1Thread2of4ForFork0_findMax_~my_max~0#1=|v_thr1Thread2of4ForFork0_findMax_~my_max~0#1_41|, thr1Thread2of4ForFork0_#res#1.base=|v_thr1Thread2of4ForFork0_#res#1.base_9|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_#res#1.offset, thr1Thread2of4ForFork0_#res#1.base][96], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 1008#true, thr1Thread2of4ForFork0InUse, Black: 392#true, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 1000#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 923#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0)), Black: 541#true, Black: 911#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 925#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 108#thr1EXITtrue, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 986#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 998#(and (< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), Black: 976#(< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 907#(<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:55:52,953 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:55:52,953 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:55:52,953 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:55:52,953 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:55:52,953 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1709] L714-1-->L718: Formula: (and (not (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|, ~m~0=v_~m~0_26, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1, ~m~0, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1][16], [210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 1008#true, thr1Thread2of4ForFork0InUse, Black: 392#true, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 1000#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 923#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 911#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), Black: 925#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 907#(<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, 108#thr1EXITtrue, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 986#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 998#(and (< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), Black: 976#(< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 116#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 858#true]) [2023-08-29 19:55:52,953 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:55:52,953 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:55:52,953 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:55:52,953 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:55:53,058 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1709] L714-1-->L718: Formula: (and (not (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|, ~m~0=v_~m~0_26, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1, ~m~0, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1][16], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 1008#true, thr1Thread2of4ForFork0InUse, Black: 392#true, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 923#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 911#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), Black: 907#(<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 986#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 998#(and (< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 976#(< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), Black: 1000#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), 116#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 933#true, 925#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|))]) [2023-08-29 19:55:53,058 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:55:53,058 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:55:53,058 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:55:53,058 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:55:53,059 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1895] L718-->thr1EXIT: Formula: (and (<= |v_thr1Thread3of4ForFork0_findMax_~my_max~0#1_39| v_~max~0_190) (= |v_thr1Thread3of4ForFork0_#res#1.base_11| 0) (= |v_thr1Thread3of4ForFork0_#res#1.offset_11| 0)) InVars {thr1Thread3of4ForFork0_findMax_~my_max~0#1=|v_thr1Thread3of4ForFork0_findMax_~my_max~0#1_39|, ~max~0=v_~max~0_190} OutVars{thr1Thread3of4ForFork0_#res#1.offset=|v_thr1Thread3of4ForFork0_#res#1.offset_11|, thr1Thread3of4ForFork0_findMax_~my_max~0#1=|v_thr1Thread3of4ForFork0_findMax_~my_max~0#1_39|, ~max~0=v_~max~0_190, thr1Thread3of4ForFork0_#res#1.base=|v_thr1Thread3of4ForFork0_#res#1.base_11|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_#res#1.offset, thr1Thread3of4ForFork0_#res#1.base][121], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 1008#true, thr1Thread2of4ForFork0InUse, Black: 392#true, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 923#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 732#true, 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 911#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), Black: 907#(<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, Black: 986#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 998#(and (< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 976#(< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), Black: 1000#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 933#true, Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 925#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|))]) [2023-08-29 19:55:53,059 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 19:55:53,059 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:55:53,059 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:55:53,059 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 19:55:53,169 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1888] L718-->thr1EXIT: Formula: (and (= |v_thr1Thread2of4ForFork0_#res#1.offset_9| 0) (= |v_thr1Thread2of4ForFork0_#res#1.base_9| 0) (<= |v_thr1Thread2of4ForFork0_findMax_~my_max~0#1_41| v_~max~0_186)) InVars {~max~0=v_~max~0_186, thr1Thread2of4ForFork0_findMax_~my_max~0#1=|v_thr1Thread2of4ForFork0_findMax_~my_max~0#1_41|} OutVars{thr1Thread2of4ForFork0_#res#1.offset=|v_thr1Thread2of4ForFork0_#res#1.offset_9|, ~max~0=v_~max~0_186, thr1Thread2of4ForFork0_findMax_~my_max~0#1=|v_thr1Thread2of4ForFork0_findMax_~my_max~0#1_41|, thr1Thread2of4ForFork0_#res#1.base=|v_thr1Thread2of4ForFork0_#res#1.base_9|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_#res#1.offset, thr1Thread2of4ForFork0_#res#1.base][96], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 1008#true, thr1Thread2of4ForFork0InUse, Black: 392#true, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 1000#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 923#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0)), Black: 911#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), Black: 541#true, 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 925#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 986#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 998#(and (< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), Black: 976#(< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 907#(<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:55:53,169 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 19:55:53,169 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:55:53,169 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:55:53,169 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:55:53,169 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1709] L714-1-->L718: Formula: (and (not (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|, ~m~0=v_~m~0_26, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1, ~m~0, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1][16], [210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 1008#true, thr1Thread2of4ForFork0InUse, Black: 392#true, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 1000#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 923#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 911#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), Black: 925#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 907#(<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 986#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 998#(and (< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), Black: 976#(< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 116#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 858#true]) [2023-08-29 19:55:53,169 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 19:55:53,169 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:55:53,170 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:55:53,170 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:55:53,738 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1709] L714-1-->L718: Formula: (and (not (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|, ~m~0=v_~m~0_26, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1, ~m~0, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1][16], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 1008#true, thr1Thread2of4ForFork0InUse, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), 95#L718true, Black: 392#true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 923#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 911#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), Black: 907#(<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 986#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 998#(and (< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 976#(< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), Black: 1000#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), 116#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 933#true, 925#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:55:53,738 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 19:55:53,738 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:55:53,739 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:55:53,739 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:55:53,739 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1895] L718-->thr1EXIT: Formula: (and (<= |v_thr1Thread3of4ForFork0_findMax_~my_max~0#1_39| v_~max~0_190) (= |v_thr1Thread3of4ForFork0_#res#1.base_11| 0) (= |v_thr1Thread3of4ForFork0_#res#1.offset_11| 0)) InVars {thr1Thread3of4ForFork0_findMax_~my_max~0#1=|v_thr1Thread3of4ForFork0_findMax_~my_max~0#1_39|, ~max~0=v_~max~0_190} OutVars{thr1Thread3of4ForFork0_#res#1.offset=|v_thr1Thread3of4ForFork0_#res#1.offset_11|, thr1Thread3of4ForFork0_findMax_~my_max~0#1=|v_thr1Thread3of4ForFork0_findMax_~my_max~0#1_39|, ~max~0=v_~max~0_190, thr1Thread3of4ForFork0_#res#1.base=|v_thr1Thread3of4ForFork0_#res#1.base_11|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_#res#1.offset, thr1Thread3of4ForFork0_#res#1.base][121], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 1008#true, thr1Thread2of4ForFork0InUse, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), Black: 392#true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 732#true, Black: 923#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 911#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), Black: 907#(<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, Black: 986#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 998#(and (< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 976#(< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), Black: 1000#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 933#true, Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 925#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:55:53,739 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 19:55:53,739 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:55:53,739 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:55:53,739 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:55:53,849 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][60], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 1008#true, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 732#true, Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 923#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 925#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), Black: 907#(<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0), 911#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 986#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 998#(and (< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 976#(< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), Black: 1000#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), 116#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 933#true, Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|))]) [2023-08-29 19:55:53,850 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 19:55:53,850 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:55:53,850 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:55:53,850 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 19:55:54,084 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][60], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 1008#true, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 732#true, Black: 923#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 925#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), Black: 907#(<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0), 911#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 986#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 998#(and (< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 976#(< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), Black: 1000#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), 116#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 933#true, Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:55:54,084 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 19:55:54,084 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:55:54,084 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:55:54,084 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 19:55:54,205 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1888] L718-->thr1EXIT: Formula: (and (= |v_thr1Thread2of4ForFork0_#res#1.offset_9| 0) (= |v_thr1Thread2of4ForFork0_#res#1.base_9| 0) (<= |v_thr1Thread2of4ForFork0_findMax_~my_max~0#1_41| v_~max~0_186)) InVars {~max~0=v_~max~0_186, thr1Thread2of4ForFork0_findMax_~my_max~0#1=|v_thr1Thread2of4ForFork0_findMax_~my_max~0#1_41|} OutVars{thr1Thread2of4ForFork0_#res#1.offset=|v_thr1Thread2of4ForFork0_#res#1.offset_9|, ~max~0=v_~max~0_186, thr1Thread2of4ForFork0_findMax_~my_max~0#1=|v_thr1Thread2of4ForFork0_findMax_~my_max~0#1_41|, thr1Thread2of4ForFork0_#res#1.base=|v_thr1Thread2of4ForFork0_#res#1.base_9|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_#res#1.offset, thr1Thread2of4ForFork0_#res#1.base][96], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 1008#true, thr1Thread2of4ForFork0InUse, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), Black: 392#true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 1000#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 923#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0)), Black: 911#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 541#true, Black: 925#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 986#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 998#(and (< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), Black: 976#(< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 907#(<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|))]) [2023-08-29 19:55:54,205 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 19:55:54,205 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:55:54,205 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:55:54,206 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:55:54,206 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1709] L714-1-->L718: Formula: (and (not (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|, ~m~0=v_~m~0_26, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1, ~m~0, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1][16], [210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 1008#true, thr1Thread2of4ForFork0InUse, Black: 392#true, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 1000#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 923#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0)), Black: 911#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 925#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 907#(<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 100#L718true, 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, Black: 986#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 998#(and (< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), Black: 976#(< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 116#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 858#true]) [2023-08-29 19:55:54,206 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 19:55:54,206 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:55:54,206 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:55:54,206 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:55:54,310 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1709] L714-1-->L718: Formula: (and (not (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1_7|, ~m~0=v_~m~0_26, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond#1, ~m~0, thr1Thread1of4ForFork0_assume_abort_if_not_~cond#1][16], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 1008#true, thr1Thread2of4ForFork0InUse, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), Black: 392#true, 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 734#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 923#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0)), Black: 911#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 907#(<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 986#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 998#(and (< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 976#(< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), Black: 1000#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), 116#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 933#true, 925#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|))]) [2023-08-29 19:55:54,310 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 19:55:54,310 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:55:54,310 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:55:54,310 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:55:54,311 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1895] L718-->thr1EXIT: Formula: (and (<= |v_thr1Thread3of4ForFork0_findMax_~my_max~0#1_39| v_~max~0_190) (= |v_thr1Thread3of4ForFork0_#res#1.base_11| 0) (= |v_thr1Thread3of4ForFork0_#res#1.offset_11| 0)) InVars {thr1Thread3of4ForFork0_findMax_~my_max~0#1=|v_thr1Thread3of4ForFork0_findMax_~my_max~0#1_39|, ~max~0=v_~max~0_190} OutVars{thr1Thread3of4ForFork0_#res#1.offset=|v_thr1Thread3of4ForFork0_#res#1.offset_11|, thr1Thread3of4ForFork0_findMax_~my_max~0#1=|v_thr1Thread3of4ForFork0_findMax_~my_max~0#1_39|, ~max~0=v_~max~0_190, thr1Thread3of4ForFork0_#res#1.base=|v_thr1Thread3of4ForFork0_#res#1.base_11|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_#res#1.offset, thr1Thread3of4ForFork0_#res#1.base][121], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 1008#true, thr1Thread2of4ForFork0InUse, 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), Black: 392#true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 732#true, Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 923#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0)), Black: 911#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), Black: 907#(<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 108#thr1EXITtrue, Black: 986#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 998#(and (< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 976#(< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), Black: 1000#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 933#true, Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 925#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), 76#L714-1true, Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|))]) [2023-08-29 19:55:54,311 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 19:55:54,311 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:55:54,311 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 19:55:54,311 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:55:54,413 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1617] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][60], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 1008#true, thr1Thread2of4ForFork0InUse, Black: 394#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 742#(<= (+ 2 |thr1Thread4of4ForFork0_findMax_~offset#1|) |thr1Thread4of4ForFork0_findMax_~i~0#1|), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 551#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 550#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 727#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 543#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 732#true, Black: 923#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0)), 289#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 925#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 226#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), Black: 907#(<= |thr1Thread2of4ForFork0_findMax_~my_max~0#1| ~max~0), 911#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 234#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 986#(<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), 215#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 998#(and (< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), 219#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 976#(< ~max~0 |thr1Thread1of4ForFork0_findMax_~my_max~0#1|), Black: 1000#(and (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread2of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), 116#L718true, Black: 401#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 933#true, Black: 288#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 441#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 402#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 725#(and (= |~#storage~0.offset| 0) (or (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) (<= 24 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|))) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 316#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-29 19:55:54,413 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 19:55:54,413 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:55:54,413 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:55:54,413 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 19:55:54,467 INFO L130 PetriNetUnfolder]: 109362/172302 cut-off events. [2023-08-29 19:55:54,468 INFO L131 PetriNetUnfolder]: For 358229/415923 co-relation queries the response was YES. [2023-08-29 19:55:55,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508478 conditions, 172302 events. 109362/172302 cut-off events. For 358229/415923 co-relation queries the response was YES. Maximal size of possible extension queue 8894. Compared 1686483 event pairs, 62029 based on Foata normal form. 5255/165319 useless extension candidates. Maximal degree in co-relation 508451. Up to 118919 conditions per place. [2023-08-29 19:55:56,440 INFO L137 encePairwiseOnDemand]: 442/445 looper letters, 94 selfloop transitions, 3 changer transitions 0/196 dead transitions. [2023-08-29 19:55:56,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 196 transitions, 1801 flow [2023-08-29 19:55:56,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:55:56,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:55:56,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 824 transitions. [2023-08-29 19:55:56,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46292134831460674 [2023-08-29 19:55:56,442 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 824 transitions. [2023-08-29 19:55:56,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 824 transitions. [2023-08-29 19:55:56,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:55:56,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 824 transitions. [2023-08-29 19:55:56,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:56,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 445.0) internal successors, (2225), 5 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:56,444 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 445.0) internal successors, (2225), 5 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:56,444 INFO L175 Difference]: Start difference. First operand has 98 places, 145 transitions, 1398 flow. Second operand 4 states and 824 transitions. [2023-08-29 19:55:56,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 196 transitions, 1801 flow [2023-08-29 19:56:02,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 196 transitions, 1763 flow, removed 19 selfloop flow, removed 0 redundant places. [2023-08-29 19:56:02,933 INFO L231 Difference]: Finished difference. Result has 101 places, 144 transitions, 1361 flow [2023-08-29 19:56:02,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1361, PETRI_PLACES=101, PETRI_TRANSITIONS=144} [2023-08-29 19:56:02,934 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 39 predicate places. [2023-08-29 19:56:02,934 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 144 transitions, 1361 flow [2023-08-29 19:56:02,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 192.6) internal successors, (963), 5 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:02,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:02,934 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:56:02,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2023-08-29 19:56:03,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:56:03,135 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 15 more)] === [2023-08-29 19:56:03,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:03,135 INFO L85 PathProgramCache]: Analyzing trace with hash 357538012, now seen corresponding path program 1 times [2023-08-29 19:56:03,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:56:03,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789841502] [2023-08-29 19:56:03,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:03,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:56:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:03,162 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-29 19:56:03,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:56:03,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789841502] [2023-08-29 19:56:03,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789841502] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:03,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:03,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:56:03,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678615374] [2023-08-29 19:56:03,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:03,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:56:03,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:56:03,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:56:03,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:56:03,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 445 [2023-08-29 19:56:03,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 144 transitions, 1361 flow. Second operand has 4 states, 4 states have (on average 187.75) internal successors, (751), 4 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:03,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:03,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 445 [2023-08-29 19:56:03,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:41,015 INFO L130 PetriNetUnfolder]: 258154/362076 cut-off events. [2023-08-29 19:56:41,016 INFO L131 PetriNetUnfolder]: For 956510/989476 co-relation queries the response was YES. [2023-08-29 19:56:43,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1201485 conditions, 362076 events. 258154/362076 cut-off events. For 956510/989476 co-relation queries the response was YES. Maximal size of possible extension queue 15902. Compared 3071526 event pairs, 38279 based on Foata normal form. 8389/353200 useless extension candidates. Maximal degree in co-relation 1201457. Up to 182974 conditions per place. [2023-08-29 19:56:46,145 INFO L137 encePairwiseOnDemand]: 434/445 looper letters, 161 selfloop transitions, 136 changer transitions 0/320 dead transitions. [2023-08-29 19:56:46,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 320 transitions, 3530 flow [2023-08-29 19:56:46,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 19:56:46,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 19:56:46,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1034 transitions. [2023-08-29 19:56:46,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4647191011235955 [2023-08-29 19:56:46,148 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1034 transitions. [2023-08-29 19:56:46,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1034 transitions. [2023-08-29 19:56:46,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:46,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1034 transitions. [2023-08-29 19:56:46,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 206.8) internal successors, (1034), 5 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:46,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 445.0) internal successors, (2670), 6 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:46,151 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 445.0) internal successors, (2670), 6 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:46,151 INFO L175 Difference]: Start difference. First operand has 101 places, 144 transitions, 1361 flow. Second operand 5 states and 1034 transitions. [2023-08-29 19:56:46,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 320 transitions, 3530 flow [2023-08-29 19:57:50,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 320 transitions, 3506 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 19:57:50,931 INFO L231 Difference]: Finished difference. Result has 106 places, 235 transitions, 3122 flow [2023-08-29 19:57:50,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3122, PETRI_PLACES=106, PETRI_TRANSITIONS=235} [2023-08-29 19:57:50,932 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 44 predicate places. [2023-08-29 19:57:50,932 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 235 transitions, 3122 flow [2023-08-29 19:57:50,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 187.75) internal successors, (751), 4 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:57:50,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:57:50,932 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:57:50,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2023-08-29 19:57:50,932 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 15 more)] === [2023-08-29 19:57:50,932 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:57:50,932 INFO L85 PathProgramCache]: Analyzing trace with hash 597419249, now seen corresponding path program 2 times [2023-08-29 19:57:50,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:57:50,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430799732] [2023-08-29 19:57:50,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:57:50,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:57:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:57:50,970 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 19:57:50,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:57:50,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430799732] [2023-08-29 19:57:50,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430799732] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:57:50,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:57:50,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 19:57:50,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367263372] [2023-08-29 19:57:50,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:57:50,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:57:50,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:57:50,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:57:50,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:57:51,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 445 [2023-08-29 19:57:51,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 235 transitions, 3122 flow. Second operand has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:57:51,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:57:51,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 445 [2023-08-29 19:57:51,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:58:49,823 INFO L130 PetriNetUnfolder]: 313381/447014 cut-off events. [2023-08-29 19:58:49,836 INFO L131 PetriNetUnfolder]: For 1552077/1566052 co-relation queries the response was YES.