./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 TOGETHER --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 TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:31:17,410 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:31:17,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:31:17,454 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:31:17,454 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:31:17,455 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:31:17,456 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:31:17,457 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:31:17,459 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:31:17,459 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:31:17,460 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:31:17,462 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:31:17,462 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:31:17,463 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:31:17,464 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:31:17,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:31:17,469 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:31:17,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:31:17,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:31:17,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:31:17,480 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:31:17,494 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:31:17,495 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:31:17,496 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:31:17,498 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:31:17,502 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:31:17,502 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:31:17,503 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:31:17,503 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:31:17,504 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:31:17,505 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:31:17,506 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:31:17,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:31:17,508 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:31:17,509 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:31:17,510 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:31:17,511 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:31:17,511 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:31:17,511 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:31:17,512 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:31:17,513 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:31:17,514 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 02:31:17,542 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:31:17,543 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:31:17,544 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:31:17,544 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:31:17,545 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:31:17,545 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:31:17,546 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:31:17,546 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:31:17,546 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:31:17,546 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:31:17,547 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:31:17,547 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:31:17,547 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:31:17,548 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:31:17,548 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:31:17,548 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:31:17,548 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:31:17,548 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:31:17,549 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:31:17,549 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:31:17,549 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:31:17,549 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:31:17,549 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:31:17,550 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:31:17,550 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:31:17,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:31:17,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:31:17,551 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:31:17,551 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 02:31:17,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 02:31:17,551 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:31:17,551 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:31:17,552 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:31:17,552 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:31:17,552 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 -> TOGETHER [2023-08-30 02:31:17,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:31:17,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:31:17,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:31:17,854 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:31:17,854 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:31:17,856 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-30 02:31:19,077 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:31:19,300 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:31:19,301 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/11_fmaxsymopt.i [2023-08-30 02:31:19,315 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04df1c5ea/cc964a0e2a6d410ba07af19a8c7141eb/FLAGc4ec247cf [2023-08-30 02:31:19,326 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04df1c5ea/cc964a0e2a6d410ba07af19a8c7141eb [2023-08-30 02:31:19,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:31:19,328 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:31:19,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:31:19,330 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:31:19,334 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:31:19,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:31:19" (1/1) ... [2023-08-30 02:31:19,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c6001e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:31:19, skipping insertion in model container [2023-08-30 02:31:19,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:31:19" (1/1) ... [2023-08-30 02:31:19,344 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:31:19,370 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:31:19,635 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-30 02:31:19,646 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:31:19,657 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:31:19,705 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-30 02:31:19,713 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:31:19,753 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:31:19,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:31:19 WrapperNode [2023-08-30 02:31:19,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:31:19,755 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:31:19,755 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:31:19,755 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:31:19,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:31:19" (1/1) ... [2023-08-30 02:31:19,783 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:31:19" (1/1) ... [2023-08-30 02:31:19,810 INFO L138 Inliner]: procedures = 171, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 83 [2023-08-30 02:31:19,811 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:31:19,812 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:31:19,812 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:31:19,812 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:31:19,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:31:19" (1/1) ... [2023-08-30 02:31:19,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:31:19" (1/1) ... [2023-08-30 02:31:19,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:31:19" (1/1) ... [2023-08-30 02:31:19,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:31:19" (1/1) ... [2023-08-30 02:31:19,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:31:19" (1/1) ... [2023-08-30 02:31:19,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:31:19" (1/1) ... [2023-08-30 02:31:19,847 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:31:19" (1/1) ... [2023-08-30 02:31:19,848 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:31:19" (1/1) ... [2023-08-30 02:31:19,850 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:31:19,850 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:31:19,851 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:31:19,851 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:31:19,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:31:19" (1/1) ... [2023-08-30 02:31:19,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:31:19,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:31:19,878 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-30 02:31:19,884 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-30 02:31:19,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 02:31:19,909 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-30 02:31:19,909 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-30 02:31:19,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 02:31:19,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:31:19,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:31:19,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:31:19,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 02:31:19,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:31:19,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:31:19,911 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:31:20,002 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:31:20,004 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:31:20,258 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:31:20,288 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:31:20,288 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-30 02:31:20,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:31:20 BoogieIcfgContainer [2023-08-30 02:31:20,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:31:20,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:31:20,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:31:20,298 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:31:20,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:31:19" (1/3) ... [2023-08-30 02:31:20,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c59f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:31:20, skipping insertion in model container [2023-08-30 02:31:20,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:31:19" (2/3) ... [2023-08-30 02:31:20,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c59f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:31:20, skipping insertion in model container [2023-08-30 02:31:20,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:31:20" (3/3) ... [2023-08-30 02:31:20,315 INFO L112 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2023-08-30 02:31:20,330 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:31:20,331 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-30 02:31:20,336 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:31:20,440 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:31:20,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 86 transitions, 177 flow [2023-08-30 02:31:20,523 INFO L130 PetriNetUnfolder]: 9/101 cut-off events. [2023-08-30 02:31:20,529 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:31:20,534 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-30 02:31:20,535 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 86 transitions, 177 flow [2023-08-30 02:31:20,540 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 86 transitions, 177 flow [2023-08-30 02:31:20,543 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:31:20,555 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 86 transitions, 177 flow [2023-08-30 02:31:20,559 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 86 transitions, 177 flow [2023-08-30 02:31:20,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 86 transitions, 177 flow [2023-08-30 02:31:20,584 INFO L130 PetriNetUnfolder]: 9/101 cut-off events. [2023-08-30 02:31:20,584 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:31:20,585 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-30 02:31:20,586 INFO L119 LiptonReduction]: Number of co-enabled transitions 1656 [2023-08-30 02:31:23,335 INFO L134 LiptonReduction]: Checked pairs total: 1674 [2023-08-30 02:31:23,336 INFO L136 LiptonReduction]: Total number of compositions: 94 [2023-08-30 02:31:23,348 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:31:23,353 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;@7dd0f6e4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:31:23,353 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-30 02:31:23,355 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-08-30 02:31:23,356 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:31:23,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:23,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 02:31:23,357 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2023-08-30 02:31:23,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:23,361 INFO L85 PathProgramCache]: Analyzing trace with hash 13255, now seen corresponding path program 1 times [2023-08-30 02:31:23,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:23,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266593516] [2023-08-30 02:31:23,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:23,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:23,549 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-30 02:31:23,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:23,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266593516] [2023-08-30 02:31:23,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266593516] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:31:23,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:31:23,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:31:23,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588256003] [2023-08-30 02:31:23,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:31:23,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:31:23,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:23,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:31:23,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:31:23,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 180 [2023-08-30 02:31:23,582 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-30 02:31:23,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:23,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 180 [2023-08-30 02:31:23,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:23,634 INFO L130 PetriNetUnfolder]: 21/51 cut-off events. [2023-08-30 02:31:23,634 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:31:23,635 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-30 02:31:23,637 INFO L137 encePairwiseOnDemand]: 177/180 looper letters, 11 selfloop transitions, 0 changer transitions 0/12 dead transitions. [2023-08-30 02:31:23,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 15 places, 12 transitions, 51 flow [2023-08-30 02:31:23,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:31:23,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:31:23,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 168 transitions. [2023-08-30 02:31:23,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2023-08-30 02:31:23,651 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 168 transitions. [2023-08-30 02:31:23,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 168 transitions. [2023-08-30 02:31:23,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:23,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 168 transitions. [2023-08-30 02:31:23,661 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-30 02:31:23,668 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-30 02:31:23,669 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-30 02:31:23,670 INFO L175 Difference]: Start difference. First operand has 17 places, 15 transitions, 35 flow. Second operand 2 states and 168 transitions. [2023-08-30 02:31:23,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 15 places, 12 transitions, 51 flow [2023-08-30 02:31:23,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 12 transitions, 51 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:31:23,674 INFO L231 Difference]: Finished difference. Result has 15 places, 12 transitions, 29 flow [2023-08-30 02:31:23,676 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-30 02:31:23,679 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, -2 predicate places. [2023-08-30 02:31:23,680 INFO L495 AbstractCegarLoop]: Abstraction has has 15 places, 12 transitions, 29 flow [2023-08-30 02:31:23,680 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-30 02:31:23,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:23,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 02:31:23,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 02:31:23,681 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2023-08-30 02:31:23,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:23,688 INFO L85 PathProgramCache]: Analyzing trace with hash 13250, now seen corresponding path program 1 times [2023-08-30 02:31:23,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:23,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685881490] [2023-08-30 02:31:23,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:23,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:23,836 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-30 02:31:23,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:23,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685881490] [2023-08-30 02:31:23,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685881490] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:31:23,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:31:23,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:31:23,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686904912] [2023-08-30 02:31:23,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:31:23,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:31:23,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:23,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:31:23,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:31:23,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 180 [2023-08-30 02:31:23,864 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-30 02:31:23,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:23,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 180 [2023-08-30 02:31:23,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:23,882 INFO L130 PetriNetUnfolder]: 16/40 cut-off events. [2023-08-30 02:31:23,882 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:31:23,883 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-30 02:31:23,883 INFO L137 encePairwiseOnDemand]: 178/180 looper letters, 9 selfloop transitions, 1 changer transitions 0/11 dead transitions. [2023-08-30 02:31:23,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 16 places, 11 transitions, 47 flow [2023-08-30 02:31:23,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:31:23,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:31:23,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2023-08-30 02:31:23,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2023-08-30 02:31:23,885 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 230 transitions. [2023-08-30 02:31:23,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 230 transitions. [2023-08-30 02:31:23,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:23,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 230 transitions. [2023-08-30 02:31:23,887 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-30 02:31:23,888 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-30 02:31:23,889 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-30 02:31:23,889 INFO L175 Difference]: Start difference. First operand has 15 places, 12 transitions, 29 flow. Second operand 3 states and 230 transitions. [2023-08-30 02:31:23,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 16 places, 11 transitions, 47 flow [2023-08-30 02:31:23,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 11 transitions, 47 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:31:23,890 INFO L231 Difference]: Finished difference. Result has 16 places, 11 transitions, 29 flow [2023-08-30 02:31:23,890 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-30 02:31:23,891 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, -1 predicate places. [2023-08-30 02:31:23,891 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 11 transitions, 29 flow [2023-08-30 02:31:23,891 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-30 02:31:23,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:23,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 02:31:23,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 02:31:23,892 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2023-08-30 02:31:23,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:23,892 INFO L85 PathProgramCache]: Analyzing trace with hash 13252, now seen corresponding path program 1 times [2023-08-30 02:31:23,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:23,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961415621] [2023-08-30 02:31:23,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:23,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:23,937 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-30 02:31:23,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:23,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961415621] [2023-08-30 02:31:23,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961415621] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:31:23,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:31:23,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:31:23,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525740417] [2023-08-30 02:31:23,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:31:23,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:31:23,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:23,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:31:23,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:31:23,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 180 [2023-08-30 02:31:23,962 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-30 02:31:23,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:23,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 180 [2023-08-30 02:31:23,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:23,977 INFO L130 PetriNetUnfolder]: 11/29 cut-off events. [2023-08-30 02:31:23,977 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:31:23,978 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-30 02:31:23,978 INFO L137 encePairwiseOnDemand]: 178/180 looper letters, 8 selfloop transitions, 1 changer transitions 0/10 dead transitions. [2023-08-30 02:31:23,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 10 transitions, 45 flow [2023-08-30 02:31:23,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:31:23,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:31:23,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2023-08-30 02:31:23,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.412962962962963 [2023-08-30 02:31:23,980 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 223 transitions. [2023-08-30 02:31:23,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 223 transitions. [2023-08-30 02:31:23,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:23,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 223 transitions. [2023-08-30 02:31:23,981 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-30 02:31:23,982 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-30 02:31:23,983 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-30 02:31:23,983 INFO L175 Difference]: Start difference. First operand has 16 places, 11 transitions, 29 flow. Second operand 3 states and 223 transitions. [2023-08-30 02:31:23,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 10 transitions, 45 flow [2023-08-30 02:31:23,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 10 transitions, 44 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:31:23,984 INFO L231 Difference]: Finished difference. Result has 16 places, 10 transitions, 28 flow [2023-08-30 02:31:23,984 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=28, PETRI_PLACES=16, PETRI_TRANSITIONS=10} [2023-08-30 02:31:23,985 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, -1 predicate places. [2023-08-30 02:31:23,985 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 10 transitions, 28 flow [2023-08-30 02:31:23,985 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-30 02:31:23,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:23,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:31:23,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 02:31:23,986 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2023-08-30 02:31:23,986 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:23,986 INFO L85 PathProgramCache]: Analyzing trace with hash 395056421, now seen corresponding path program 1 times [2023-08-30 02:31:23,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:23,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958341073] [2023-08-30 02:31:23,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:23,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:24,143 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-30 02:31:24,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:24,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958341073] [2023-08-30 02:31:24,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958341073] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:31:24,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:31:24,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:31:24,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381273451] [2023-08-30 02:31:24,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:31:24,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:31:24,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:24,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:31:24,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:31:24,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 180 [2023-08-30 02:31:24,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 16 places, 10 transitions, 28 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-30 02:31:24,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:24,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 180 [2023-08-30 02:31:24,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:24,234 INFO L130 PetriNetUnfolder]: 9/24 cut-off events. [2023-08-30 02:31:24,234 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:31:24,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 24 events. 9/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 40 event pairs, 6 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 52. Up to 23 conditions per place. [2023-08-30 02:31:24,234 INFO L137 encePairwiseOnDemand]: 178/180 looper letters, 7 selfloop transitions, 1 changer transitions 0/9 dead transitions. [2023-08-30 02:31:24,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 9 transitions, 42 flow [2023-08-30 02:31:24,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:31:24,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:31:24,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2023-08-30 02:31:24,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39444444444444443 [2023-08-30 02:31:24,236 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 213 transitions. [2023-08-30 02:31:24,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 213 transitions. [2023-08-30 02:31:24,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:24,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 213 transitions. [2023-08-30 02:31:24,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:24,238 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-30 02:31:24,239 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-30 02:31:24,239 INFO L175 Difference]: Start difference. First operand has 16 places, 10 transitions, 28 flow. Second operand 3 states and 213 transitions. [2023-08-30 02:31:24,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 9 transitions, 42 flow [2023-08-30 02:31:24,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 9 transitions, 41 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:31:24,240 INFO L231 Difference]: Finished difference. Result has 16 places, 9 transitions, 27 flow [2023-08-30 02:31:24,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=25, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=9, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=27, PETRI_PLACES=16, PETRI_TRANSITIONS=9} [2023-08-30 02:31:24,240 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, -1 predicate places. [2023-08-30 02:31:24,240 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 9 transitions, 27 flow [2023-08-30 02:31:24,241 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-30 02:31:24,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:24,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:31:24,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 02:31:24,241 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2023-08-30 02:31:24,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:24,242 INFO L85 PathProgramCache]: Analyzing trace with hash 395056422, now seen corresponding path program 1 times [2023-08-30 02:31:24,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:24,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178498901] [2023-08-30 02:31:24,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:24,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:24,405 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-30 02:31:24,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:24,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178498901] [2023-08-30 02:31:24,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178498901] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:31:24,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:31:24,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:31:24,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76845685] [2023-08-30 02:31:24,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:31:24,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:31:24,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:24,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:31:24,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:31:24,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 180 [2023-08-30 02:31:24,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 16 places, 9 transitions, 27 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-30 02:31:24,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:24,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 180 [2023-08-30 02:31:24,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:24,499 INFO L130 PetriNetUnfolder]: 13/34 cut-off events. [2023-08-30 02:31:24,500 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:31:24,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 34 events. 13/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 70 event pairs, 6 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 73. Up to 23 conditions per place. [2023-08-30 02:31:24,500 INFO L137 encePairwiseOnDemand]: 176/180 looper letters, 9 selfloop transitions, 3 changer transitions 0/13 dead transitions. [2023-08-30 02:31:24,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 13 transitions, 59 flow [2023-08-30 02:31:24,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:31:24,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:31:24,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 289 transitions. [2023-08-30 02:31:24,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4013888888888889 [2023-08-30 02:31:24,511 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 289 transitions. [2023-08-30 02:31:24,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 289 transitions. [2023-08-30 02:31:24,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:24,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 289 transitions. [2023-08-30 02:31:24,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 72.25) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:24,518 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-30 02:31:24,518 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-30 02:31:24,518 INFO L175 Difference]: Start difference. First operand has 16 places, 9 transitions, 27 flow. Second operand 4 states and 289 transitions. [2023-08-30 02:31:24,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 13 transitions, 59 flow [2023-08-30 02:31:24,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 13 transitions, 58 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:31:24,519 INFO L231 Difference]: Finished difference. Result has 19 places, 10 transitions, 40 flow [2023-08-30 02:31:24,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=26, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=9, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=40, PETRI_PLACES=19, PETRI_TRANSITIONS=10} [2023-08-30 02:31:24,522 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, 2 predicate places. [2023-08-30 02:31:24,522 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 10 transitions, 40 flow [2023-08-30 02:31:24,523 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-30 02:31:24,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:24,523 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-30 02:31:24,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 02:31:24,523 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2023-08-30 02:31:24,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:24,525 INFO L85 PathProgramCache]: Analyzing trace with hash -638216031, now seen corresponding path program 1 times [2023-08-30 02:31:24,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:24,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734507225] [2023-08-30 02:31:24,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:24,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:31:24,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:31:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:31:24,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:31:24,576 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:31:24,577 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2023-08-30 02:31:24,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2023-08-30 02:31:24,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-08-30 02:31:24,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (6 of 10 remaining) [2023-08-30 02:31:24,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-08-30 02:31:24,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-08-30 02:31:24,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-08-30 02:31:24,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 10 remaining) [2023-08-30 02:31:24,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 10 remaining) [2023-08-30 02:31:24,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-08-30 02:31:24,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 02:31:24,585 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-30 02:31:24,588 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-30 02:31:24,588 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-30 02:31:24,629 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:31:24,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 133 transitions, 278 flow [2023-08-30 02:31:24,658 INFO L130 PetriNetUnfolder]: 17/165 cut-off events. [2023-08-30 02:31:24,658 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 02:31:24,659 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-30 02:31:24,660 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 133 transitions, 278 flow [2023-08-30 02:31:24,661 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 133 transitions, 278 flow [2023-08-30 02:31:24,661 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:31:24,661 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 133 transitions, 278 flow [2023-08-30 02:31:24,661 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 133 transitions, 278 flow [2023-08-30 02:31:24,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 133 transitions, 278 flow [2023-08-30 02:31:24,677 INFO L130 PetriNetUnfolder]: 17/165 cut-off events. [2023-08-30 02:31:24,677 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 02:31:24,679 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-30 02:31:24,682 INFO L119 LiptonReduction]: Number of co-enabled transitions 7636 [2023-08-30 02:31:27,347 INFO L134 LiptonReduction]: Checked pairs total: 10505 [2023-08-30 02:31:27,348 INFO L136 LiptonReduction]: Total number of compositions: 124 [2023-08-30 02:31:27,349 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:31:27,350 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;@7dd0f6e4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:31:27,350 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-30 02:31:27,351 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 02:31:27,351 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:31:27,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:27,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 02:31:27,352 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-08-30 02:31:27,352 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:27,352 INFO L85 PathProgramCache]: Analyzing trace with hash 23008, now seen corresponding path program 1 times [2023-08-30 02:31:27,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:27,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862792007] [2023-08-30 02:31:27,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:27,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:27,367 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-30 02:31:27,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:27,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862792007] [2023-08-30 02:31:27,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862792007] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:31:27,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:31:27,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:31:27,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910304914] [2023-08-30 02:31:27,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:31:27,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:31:27,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:27,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:31:27,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:31:27,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 257 [2023-08-30 02:31:27,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 118.0) internal successors, (236), 2 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:27,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:27,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 257 [2023-08-30 02:31:27,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:27,447 INFO L130 PetriNetUnfolder]: 404/780 cut-off events. [2023-08-30 02:31:27,447 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2023-08-30 02:31:27,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1419 conditions, 780 events. 404/780 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4556 event pairs, 312 based on Foata normal form. 59/502 useless extension candidates. Maximal degree in co-relation 344. Up to 601 conditions per place. [2023-08-30 02:31:27,452 INFO L137 encePairwiseOnDemand]: 251/257 looper letters, 20 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2023-08-30 02:31:27,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 118 flow [2023-08-30 02:31:27,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:31:27,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:31:27,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 260 transitions. [2023-08-30 02:31:27,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5058365758754864 [2023-08-30 02:31:27,454 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 260 transitions. [2023-08-30 02:31:27,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 260 transitions. [2023-08-30 02:31:27,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:27,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 260 transitions. [2023-08-30 02:31:27,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 130.0) internal successors, (260), 2 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:27,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:27,457 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:27,457 INFO L175 Difference]: Start difference. First operand has 36 places, 39 transitions, 90 flow. Second operand 2 states and 260 transitions. [2023-08-30 02:31:27,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 118 flow [2023-08-30 02:31:27,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 116 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-30 02:31:27,459 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 76 flow [2023-08-30 02:31:27,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=76, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2023-08-30 02:31:27,459 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2023-08-30 02:31:27,460 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 76 flow [2023-08-30 02:31:27,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 118.0) internal successors, (236), 2 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:27,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:27,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 02:31:27,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 02:31:27,461 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-08-30 02:31:27,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:27,461 INFO L85 PathProgramCache]: Analyzing trace with hash 23001, now seen corresponding path program 1 times [2023-08-30 02:31:27,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:27,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701990652] [2023-08-30 02:31:27,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:27,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:27,487 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-30 02:31:27,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:27,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701990652] [2023-08-30 02:31:27,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701990652] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:31:27,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:31:27,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:31:27,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52128895] [2023-08-30 02:31:27,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:31:27,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:31:27,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:27,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:31:27,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:31:27,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 257 [2023-08-30 02:31:27,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 76 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-30 02:31:27,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:27,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 257 [2023-08-30 02:31:27,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:27,582 INFO L130 PetriNetUnfolder]: 291/578 cut-off events. [2023-08-30 02:31:27,583 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2023-08-30 02:31:27,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1050 conditions, 578 events. 291/578 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3150 event pairs, 222 based on Foata normal form. 0/351 useless extension candidates. Maximal degree in co-relation 1045. Up to 438 conditions per place. [2023-08-30 02:31:27,586 INFO L137 encePairwiseOnDemand]: 255/257 looper letters, 18 selfloop transitions, 1 changer transitions 0/32 dead transitions. [2023-08-30 02:31:27,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 112 flow [2023-08-30 02:31:27,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:31:27,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:31:27,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2023-08-30 02:31:27,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4656290531776913 [2023-08-30 02:31:27,588 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2023-08-30 02:31:27,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2023-08-30 02:31:27,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:27,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2023-08-30 02:31:27,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-30 02:31:27,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:27,591 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:27,591 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 76 flow. Second operand 3 states and 359 transitions. [2023-08-30 02:31:27,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 112 flow [2023-08-30 02:31:27,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 112 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:31:27,593 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 76 flow [2023-08-30 02:31:27,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, 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=36, PETRI_TRANSITIONS=32} [2023-08-30 02:31:27,593 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2023-08-30 02:31:27,594 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 76 flow [2023-08-30 02:31:27,594 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-30 02:31:27,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:27,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 02:31:27,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 02:31:27,594 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-08-30 02:31:27,595 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:27,595 INFO L85 PathProgramCache]: Analyzing trace with hash 22999, now seen corresponding path program 1 times [2023-08-30 02:31:27,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:27,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139801248] [2023-08-30 02:31:27,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:27,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:27,611 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-30 02:31:27,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:27,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139801248] [2023-08-30 02:31:27,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139801248] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:31:27,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:31:27,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:31:27,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226373852] [2023-08-30 02:31:27,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:31:27,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:31:27,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:27,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:31:27,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:31:27,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 257 [2023-08-30 02:31:27,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 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-30 02:31:27,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:27,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 257 [2023-08-30 02:31:27,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:27,681 INFO L130 PetriNetUnfolder]: 178/376 cut-off events. [2023-08-30 02:31:27,681 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2023-08-30 02:31:27,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 688 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 1854 event pairs, 132 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 682. Up to 276 conditions per place. [2023-08-30 02:31:27,684 INFO L137 encePairwiseOnDemand]: 255/257 looper letters, 17 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2023-08-30 02:31:27,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 110 flow [2023-08-30 02:31:27,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:31:27,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:31:27,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2023-08-30 02:31:27,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4565499351491569 [2023-08-30 02:31:27,687 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2023-08-30 02:31:27,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2023-08-30 02:31:27,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:27,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2023-08-30 02:31:27,689 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-30 02:31:27,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:27,691 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:27,691 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 76 flow. Second operand 3 states and 352 transitions. [2023-08-30 02:31:27,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 110 flow [2023-08-30 02:31:27,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 31 transitions, 109 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:31:27,692 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 75 flow [2023-08-30 02:31:27,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=34, 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=36, PETRI_TRANSITIONS=31} [2023-08-30 02:31:27,693 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2023-08-30 02:31:27,693 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 75 flow [2023-08-30 02:31:27,693 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-30 02:31:27,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:27,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:31:27,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 02:31:27,694 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-08-30 02:31:27,694 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:27,694 INFO L85 PathProgramCache]: Analyzing trace with hash 685760952, now seen corresponding path program 1 times [2023-08-30 02:31:27,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:27,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075349811] [2023-08-30 02:31:27,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:27,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:27,814 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-30 02:31:27,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:27,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075349811] [2023-08-30 02:31:27,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075349811] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:31:27,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:31:27,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:31:27,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819213302] [2023-08-30 02:31:27,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:31:27,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:31:27,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:27,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:31:27,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:31:27,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 257 [2023-08-30 02:31:27,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 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-30 02:31:27,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:27,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 257 [2023-08-30 02:31:27,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:27,943 INFO L130 PetriNetUnfolder]: 222/444 cut-off events. [2023-08-30 02:31:27,943 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2023-08-30 02:31:27,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 841 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 2322 event pairs, 132 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 835. Up to 276 conditions per place. [2023-08-30 02:31:27,945 INFO L137 encePairwiseOnDemand]: 252/257 looper letters, 26 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2023-08-30 02:31:27,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 160 flow [2023-08-30 02:31:27,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:31:27,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:31:27,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 467 transitions. [2023-08-30 02:31:27,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45428015564202334 [2023-08-30 02:31:27,947 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 467 transitions. [2023-08-30 02:31:27,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 467 transitions. [2023-08-30 02:31:27,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:27,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 467 transitions. [2023-08-30 02:31:27,949 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-30 02:31:27,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:27,951 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:27,951 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 75 flow. Second operand 4 states and 467 transitions. [2023-08-30 02:31:27,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 160 flow [2023-08-30 02:31:27,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 42 transitions, 159 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:31:27,952 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 90 flow [2023-08-30 02:31:27,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=35, 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=39, PETRI_TRANSITIONS=32} [2023-08-30 02:31:27,953 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2023-08-30 02:31:27,953 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 90 flow [2023-08-30 02:31:27,953 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-30 02:31:27,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:27,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:31:27,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 02:31:27,953 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-08-30 02:31:27,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:27,954 INFO L85 PathProgramCache]: Analyzing trace with hash 685760951, now seen corresponding path program 1 times [2023-08-30 02:31:27,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:27,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357516954] [2023-08-30 02:31:27,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:27,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:28,023 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-30 02:31:28,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:28,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357516954] [2023-08-30 02:31:28,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357516954] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:31:28,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:31:28,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:31:28,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701120784] [2023-08-30 02:31:28,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:31:28,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:31:28,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:28,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:31:28,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:31:28,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 257 [2023-08-30 02:31:28,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 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-30 02:31:28,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:28,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 257 [2023-08-30 02:31:28,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:28,147 INFO L130 PetriNetUnfolder]: 155/331 cut-off events. [2023-08-30 02:31:28,147 INFO L131 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2023-08-30 02:31:28,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 695 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 1564 event pairs, 113 based on Foata normal form. 28/278 useless extension candidates. Maximal degree in co-relation 688. Up to 241 conditions per place. [2023-08-30 02:31:28,149 INFO L137 encePairwiseOnDemand]: 254/257 looper letters, 16 selfloop transitions, 1 changer transitions 0/30 dead transitions. [2023-08-30 02:31:28,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 30 transitions, 120 flow [2023-08-30 02:31:28,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:31:28,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:31:28,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2023-08-30 02:31:28,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4357976653696498 [2023-08-30 02:31:28,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2023-08-30 02:31:28,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2023-08-30 02:31:28,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:28,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2023-08-30 02:31:28,152 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-30 02:31:28,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:28,153 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:28,154 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 90 flow. Second operand 3 states and 336 transitions. [2023-08-30 02:31:28,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 30 transitions, 120 flow [2023-08-30 02:31:28,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 30 transitions, 114 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:31:28,155 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 82 flow [2023-08-30 02:31:28,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=35, 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=37, PETRI_TRANSITIONS=30} [2023-08-30 02:31:28,155 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2023-08-30 02:31:28,156 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 82 flow [2023-08-30 02:31:28,156 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-30 02:31:28,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:28,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 02:31:28,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 02:31:28,156 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-08-30 02:31:28,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:28,157 INFO L85 PathProgramCache]: Analyzing trace with hash -216244425, now seen corresponding path program 1 times [2023-08-30 02:31:28,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:28,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709979532] [2023-08-30 02:31:28,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:28,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:28,341 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-30 02:31:28,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:28,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709979532] [2023-08-30 02:31:28,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709979532] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:31:28,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916154415] [2023-08-30 02:31:28,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:28,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:31:28,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:31:28,349 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-30 02:31:28,368 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-30 02:31:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:28,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-30 02:31:28,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:31:28,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:31:28,536 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-30 02:31:28,690 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-30 02:31:28,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:31:28,844 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-30 02:31:28,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916154415] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:31:28,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:31:28,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2023-08-30 02:31:28,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529848921] [2023-08-30 02:31:28,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:31:28,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 02:31:28,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:28,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 02:31:28,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-08-30 02:31:29,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 257 [2023-08-30 02:31:29,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 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-30 02:31:29,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:29,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 257 [2023-08-30 02:31:29,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:29,357 INFO L130 PetriNetUnfolder]: 453/961 cut-off events. [2023-08-30 02:31:29,357 INFO L131 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2023-08-30 02:31:29,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1849 conditions, 961 events. 453/961 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6282 event pairs, 67 based on Foata normal form. 0/737 useless extension candidates. Maximal degree in co-relation 1842. Up to 184 conditions per place. [2023-08-30 02:31:29,363 INFO L137 encePairwiseOnDemand]: 253/257 looper letters, 55 selfloop transitions, 7 changer transitions 0/75 dead transitions. [2023-08-30 02:31:29,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 75 transitions, 330 flow [2023-08-30 02:31:29,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:31:29,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:31:29,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 813 transitions. [2023-08-30 02:31:29,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4519177320733741 [2023-08-30 02:31:29,366 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 813 transitions. [2023-08-30 02:31:29,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 813 transitions. [2023-08-30 02:31:29,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:29,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 813 transitions. [2023-08-30 02:31:29,369 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-30 02:31:29,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:29,372 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:29,372 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 82 flow. Second operand 7 states and 813 transitions. [2023-08-30 02:31:29,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 75 transitions, 330 flow [2023-08-30 02:31:29,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 75 transitions, 329 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:31:29,374 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 127 flow [2023-08-30 02:31:29,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=36, 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=45, PETRI_TRANSITIONS=34} [2023-08-30 02:31:29,375 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2023-08-30 02:31:29,375 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 127 flow [2023-08-30 02:31:29,376 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-30 02:31:29,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:29,376 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-30 02:31:29,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-30 02:31:29,581 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,SelfDestructingSolverStorable11 [2023-08-30 02:31:29,581 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-08-30 02:31:29,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:29,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1886359960, now seen corresponding path program 2 times [2023-08-30 02:31:29,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:29,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701976856] [2023-08-30 02:31:29,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:29,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:29,627 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-30 02:31:29,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:29,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701976856] [2023-08-30 02:31:29,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701976856] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:31:29,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391533585] [2023-08-30 02:31:29,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:31:29,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:31:29,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:31:29,631 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-30 02:31:29,633 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-30 02:31:29,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 02:31:29,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:31:29,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 02:31:29,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:31:29,721 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-30 02:31:29,721 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:31:29,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391533585] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:31:29,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 02:31:29,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-30 02:31:29,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050942829] [2023-08-30 02:31:29,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:31:29,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:31:29,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:29,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:31:29,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:31:29,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 257 [2023-08-30 02:31:29,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 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-30 02:31:29,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:29,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 257 [2023-08-30 02:31:29,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:29,837 INFO L130 PetriNetUnfolder]: 217/488 cut-off events. [2023-08-30 02:31:29,837 INFO L131 PetriNetUnfolder]: For 94/94 co-relation queries the response was YES. [2023-08-30 02:31:29,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 488 events. 217/488 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2844 event pairs, 5 based on Foata normal form. 28/445 useless extension candidates. Maximal degree in co-relation 980. Up to 238 conditions per place. [2023-08-30 02:31:29,840 INFO L137 encePairwiseOnDemand]: 253/257 looper letters, 37 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2023-08-30 02:31:29,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 238 flow [2023-08-30 02:31:29,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:31:29,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:31:29,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2023-08-30 02:31:29,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4614785992217899 [2023-08-30 02:31:29,842 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 593 transitions. [2023-08-30 02:31:29,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 593 transitions. [2023-08-30 02:31:29,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:29,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 593 transitions. [2023-08-30 02:31:29,844 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-30 02:31:29,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:29,847 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:29,847 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 127 flow. Second operand 5 states and 593 transitions. [2023-08-30 02:31:29,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 238 flow [2023-08-30 02:31:29,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 229 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-30 02:31:29,850 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 97 flow [2023-08-30 02:31:29,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, 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=43, PETRI_TRANSITIONS=30} [2023-08-30 02:31:29,851 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2023-08-30 02:31:29,851 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 97 flow [2023-08-30 02:31:29,851 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-30 02:31:29,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:29,852 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:31:29,860 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-30 02:31:30,057 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,SelfDestructingSolverStorable12 [2023-08-30 02:31:30,058 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-08-30 02:31:30,058 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:30,059 INFO L85 PathProgramCache]: Analyzing trace with hash 817343046, now seen corresponding path program 1 times [2023-08-30 02:31:30,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:30,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886329180] [2023-08-30 02:31:30,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:30,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:30,193 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-30 02:31:30,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:30,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886329180] [2023-08-30 02:31:30,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886329180] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:31:30,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:31:30,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:31:30,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275573763] [2023-08-30 02:31:30,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:31:30,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:31:30,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:30,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:31:30,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:31:30,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 257 [2023-08-30 02:31:30,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 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-30 02:31:30,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:30,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 257 [2023-08-30 02:31:30,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:30,362 INFO L130 PetriNetUnfolder]: 345/771 cut-off events. [2023-08-30 02:31:30,362 INFO L131 PetriNetUnfolder]: For 392/392 co-relation queries the response was YES. [2023-08-30 02:31:30,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1628 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 4816 event pairs, 167 based on Foata normal form. 0/661 useless extension candidates. Maximal degree in co-relation 1619. Up to 329 conditions per place. [2023-08-30 02:31:30,367 INFO L137 encePairwiseOnDemand]: 253/257 looper letters, 26 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2023-08-30 02:31:30,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 42 transitions, 203 flow [2023-08-30 02:31:30,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:31:30,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:31:30,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 462 transitions. [2023-08-30 02:31:30,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494163424124514 [2023-08-30 02:31:30,370 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 462 transitions. [2023-08-30 02:31:30,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 462 transitions. [2023-08-30 02:31:30,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:30,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 462 transitions. [2023-08-30 02:31:30,371 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-30 02:31:30,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:30,373 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:30,373 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 97 flow. Second operand 4 states and 462 transitions. [2023-08-30 02:31:30,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 42 transitions, 203 flow [2023-08-30 02:31:30,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 42 transitions, 181 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-30 02:31:30,375 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 100 flow [2023-08-30 02:31:30,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, 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=44, PETRI_TRANSITIONS=31} [2023-08-30 02:31:30,376 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2023-08-30 02:31:30,376 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 100 flow [2023-08-30 02:31:30,376 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-30 02:31:30,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:30,377 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:31:30,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 02:31:30,377 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-08-30 02:31:30,377 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:30,377 INFO L85 PathProgramCache]: Analyzing trace with hash -432166749, now seen corresponding path program 1 times [2023-08-30 02:31:30,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:30,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384782493] [2023-08-30 02:31:30,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:30,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:30,510 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-30 02:31:30,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:30,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384782493] [2023-08-30 02:31:30,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384782493] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:31:30,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857807251] [2023-08-30 02:31:30,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:30,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:31:30,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:31:30,512 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-30 02:31:30,524 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-30 02:31:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:30,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-30 02:31:30,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:31:30,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:31:30,619 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-30 02:31:30,741 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-30 02:31:30,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:31:30,907 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-30 02:31:30,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857807251] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:31:30,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:31:30,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2023-08-30 02:31:30,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738513005] [2023-08-30 02:31:30,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:31:30,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 02:31:30,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:30,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 02:31:30,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-08-30 02:31:31,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 257 [2023-08-30 02:31:31,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 100 flow. Second operand has 11 states, 11 states have (on average 110.9090909090909) internal successors, (1220), 11 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:31,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:31,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 257 [2023-08-30 02:31:31,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:31,439 INFO L130 PetriNetUnfolder]: 761/1667 cut-off events. [2023-08-30 02:31:31,439 INFO L131 PetriNetUnfolder]: For 347/347 co-relation queries the response was YES. [2023-08-30 02:31:31,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3384 conditions, 1667 events. 761/1667 cut-off events. For 347/347 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 12191 event pairs, 139 based on Foata normal form. 0/1516 useless extension candidates. Maximal degree in co-relation 3374. Up to 281 conditions per place. [2023-08-30 02:31:31,449 INFO L137 encePairwiseOnDemand]: 253/257 looper letters, 59 selfloop transitions, 7 changer transitions 0/79 dead transitions. [2023-08-30 02:31:31,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 79 transitions, 388 flow [2023-08-30 02:31:31,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:31:31,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:31:31,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 821 transitions. [2023-08-30 02:31:31,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4563646470261256 [2023-08-30 02:31:31,452 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 821 transitions. [2023-08-30 02:31:31,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 821 transitions. [2023-08-30 02:31:31,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:31,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 821 transitions. [2023-08-30 02:31:31,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:31,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:31,458 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:31,458 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 100 flow. Second operand 7 states and 821 transitions. [2023-08-30 02:31:31,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 79 transitions, 388 flow [2023-08-30 02:31:31,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 79 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:31:31,460 INFO L231 Difference]: Finished difference. Result has 51 places, 35 transitions, 142 flow [2023-08-30 02:31:31,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=42, 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=7, PETRI_FLOW=142, PETRI_PLACES=51, PETRI_TRANSITIONS=35} [2023-08-30 02:31:31,460 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2023-08-30 02:31:31,461 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 35 transitions, 142 flow [2023-08-30 02:31:31,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 110.9090909090909) internal successors, (1220), 11 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:31,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:31,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:31:31,470 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-30 02:31:31,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:31:31,667 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-08-30 02:31:31,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:31,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1143199300, now seen corresponding path program 1 times [2023-08-30 02:31:31,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:31,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411288670] [2023-08-30 02:31:31,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:31,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:31,687 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-30 02:31:31,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:31,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411288670] [2023-08-30 02:31:31,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411288670] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:31:31,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:31:31,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:31:31,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286158801] [2023-08-30 02:31:31,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:31:31,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:31:31,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:31,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:31:31,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:31:31,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 257 [2023-08-30 02:31:31,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 35 transitions, 142 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-30 02:31:31,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:31,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 257 [2023-08-30 02:31:31,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:31,987 INFO L130 PetriNetUnfolder]: 1397/2820 cut-off events. [2023-08-30 02:31:31,987 INFO L131 PetriNetUnfolder]: For 805/805 co-relation queries the response was YES. [2023-08-30 02:31:31,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6173 conditions, 2820 events. 1397/2820 cut-off events. For 805/805 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 21970 event pairs, 643 based on Foata normal form. 0/2551 useless extension candidates. Maximal degree in co-relation 6160. Up to 1426 conditions per place. [2023-08-30 02:31:32,006 INFO L137 encePairwiseOnDemand]: 252/257 looper letters, 39 selfloop transitions, 4 changer transitions 0/51 dead transitions. [2023-08-30 02:31:32,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 51 transitions, 308 flow [2023-08-30 02:31:32,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:31:32,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:31:32,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-08-30 02:31:32,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4578469520103761 [2023-08-30 02:31:32,008 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-08-30 02:31:32,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-08-30 02:31:32,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:32,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-08-30 02:31:32,010 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-30 02:31:32,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:32,011 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:32,011 INFO L175 Difference]: Start difference. First operand has 51 places, 35 transitions, 142 flow. Second operand 3 states and 353 transitions. [2023-08-30 02:31:32,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 51 transitions, 308 flow [2023-08-30 02:31:32,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 51 transitions, 287 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-30 02:31:32,015 INFO L231 Difference]: Finished difference. Result has 53 places, 37 transitions, 157 flow [2023-08-30 02:31:32,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2023-08-30 02:31:32,017 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2023-08-30 02:31:32,017 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 37 transitions, 157 flow [2023-08-30 02:31:32,017 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-30 02:31:32,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:32,017 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-30 02:31:32,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 02:31:32,018 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-08-30 02:31:32,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:32,018 INFO L85 PathProgramCache]: Analyzing trace with hash -520649536, now seen corresponding path program 1 times [2023-08-30 02:31:32,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:32,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126242794] [2023-08-30 02:31:32,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:32,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:31:32,029 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:31:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:31:32,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:31:32,048 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:31:32,048 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2023-08-30 02:31:32,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 13 remaining) [2023-08-30 02:31:32,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-30 02:31:32,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (9 of 13 remaining) [2023-08-30 02:31:32,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-30 02:31:32,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-30 02:31:32,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (6 of 13 remaining) [2023-08-30 02:31:32,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-30 02:31:32,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2023-08-30 02:31:32,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (3 of 13 remaining) [2023-08-30 02:31:32,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 13 remaining) [2023-08-30 02:31:32,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 13 remaining) [2023-08-30 02:31:32,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-30 02:31:32,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 02:31:32,051 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:31:32,052 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-30 02:31:32,052 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-08-30 02:31:32,075 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:31:32,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 180 transitions, 381 flow [2023-08-30 02:31:32,099 INFO L130 PetriNetUnfolder]: 25/229 cut-off events. [2023-08-30 02:31:32,100 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-08-30 02:31:32,101 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-30 02:31:32,101 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 180 transitions, 381 flow [2023-08-30 02:31:32,104 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 180 transitions, 381 flow [2023-08-30 02:31:32,104 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:31:32,104 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 180 transitions, 381 flow [2023-08-30 02:31:32,104 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 180 transitions, 381 flow [2023-08-30 02:31:32,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 180 transitions, 381 flow [2023-08-30 02:31:32,123 INFO L130 PetriNetUnfolder]: 25/229 cut-off events. [2023-08-30 02:31:32,123 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-08-30 02:31:32,125 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-30 02:31:32,133 INFO L119 LiptonReduction]: Number of co-enabled transitions 17940 [2023-08-30 02:31:35,543 INFO L134 LiptonReduction]: Checked pairs total: 27983 [2023-08-30 02:31:35,543 INFO L136 LiptonReduction]: Total number of compositions: 178 [2023-08-30 02:31:35,544 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:31:35,545 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;@7dd0f6e4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:31:35,545 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:31:35,546 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 02:31:35,546 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:31:35,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:35,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 02:31:35,546 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-08-30 02:31:35,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:35,547 INFO L85 PathProgramCache]: Analyzing trace with hash 35661, now seen corresponding path program 1 times [2023-08-30 02:31:35,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:35,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094899198] [2023-08-30 02:31:35,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:35,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:35,562 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-30 02:31:35,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:35,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094899198] [2023-08-30 02:31:35,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094899198] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:31:35,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:31:35,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:31:35,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385561490] [2023-08-30 02:31:35,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:31:35,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:31:35,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:35,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:31:35,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:31:35,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 358 [2023-08-30 02:31:35,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 54 transitions, 129 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-30 02:31:35,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:35,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 358 [2023-08-30 02:31:35,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:35,981 INFO L130 PetriNetUnfolder]: 3231/5255 cut-off events. [2023-08-30 02:31:35,981 INFO L131 PetriNetUnfolder]: For 421/421 co-relation queries the response was YES. [2023-08-30 02:31:35,991 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-30 02:31:36,023 INFO L137 encePairwiseOnDemand]: 348/358 looper letters, 26 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2023-08-30 02:31:36,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 45 transitions, 165 flow [2023-08-30 02:31:36,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:31:36,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:31:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2023-08-30 02:31:36,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4553072625698324 [2023-08-30 02:31:36,025 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 489 transitions. [2023-08-30 02:31:36,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 489 transitions. [2023-08-30 02:31:36,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:36,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 489 transitions. [2023-08-30 02:31:36,027 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-30 02:31:36,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:36,029 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:36,029 INFO L175 Difference]: Start difference. First operand has 49 places, 54 transitions, 129 flow. Second operand 3 states and 489 transitions. [2023-08-30 02:31:36,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 45 transitions, 165 flow [2023-08-30 02:31:36,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 45 transitions, 159 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-30 02:31:36,032 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 107 flow [2023-08-30 02:31:36,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, 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-30 02:31:36,033 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2023-08-30 02:31:36,033 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 107 flow [2023-08-30 02:31:36,034 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-30 02:31:36,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:36,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 02:31:36,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 02:31:36,034 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-08-30 02:31:36,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:36,035 INFO L85 PathProgramCache]: Analyzing trace with hash 35659, now seen corresponding path program 1 times [2023-08-30 02:31:36,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:36,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896734272] [2023-08-30 02:31:36,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:36,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:36,062 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-30 02:31:36,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:36,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896734272] [2023-08-30 02:31:36,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896734272] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:31:36,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:31:36,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:31:36,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012336300] [2023-08-30 02:31:36,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:31:36,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:31:36,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:36,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:31:36,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:31:36,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 358 [2023-08-30 02:31:36,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 107 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-30 02:31:36,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:36,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 358 [2023-08-30 02:31:36,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:36,379 INFO L130 PetriNetUnfolder]: 2040/3436 cut-off events. [2023-08-30 02:31:36,380 INFO L131 PetriNetUnfolder]: For 154/154 co-relation queries the response was YES. [2023-08-30 02:31:36,386 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-30 02:31:36,400 INFO L137 encePairwiseOnDemand]: 356/358 looper letters, 25 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2023-08-30 02:31:36,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 157 flow [2023-08-30 02:31:36,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:31:36,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:31:36,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2023-08-30 02:31:36,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45251396648044695 [2023-08-30 02:31:36,403 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 486 transitions. [2023-08-30 02:31:36,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 486 transitions. [2023-08-30 02:31:36,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:36,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 486 transitions. [2023-08-30 02:31:36,404 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-30 02:31:36,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:36,406 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:36,407 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 107 flow. Second operand 3 states and 486 transitions. [2023-08-30 02:31:36,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 44 transitions, 157 flow [2023-08-30 02:31:36,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 44 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:31:36,409 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 106 flow [2023-08-30 02:31:36,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, 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-30 02:31:36,409 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2023-08-30 02:31:36,409 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 106 flow [2023-08-30 02:31:36,410 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-30 02:31:36,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:36,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:31:36,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-30 02:31:36,410 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-08-30 02:31:36,410 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:36,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1063264244, now seen corresponding path program 1 times [2023-08-30 02:31:36,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:36,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855266610] [2023-08-30 02:31:36,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:36,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:36,469 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-30 02:31:36,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:36,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855266610] [2023-08-30 02:31:36,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855266610] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:31:36,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:31:36,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:31:36,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271896560] [2023-08-30 02:31:36,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:31:36,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:31:36,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:36,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:31:36,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:31:36,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 358 [2023-08-30 02:31:36,537 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-30 02:31:36,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:36,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 358 [2023-08-30 02:31:36,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:36,718 INFO L130 PetriNetUnfolder]: 1323/2287 cut-off events. [2023-08-30 02:31:36,718 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2023-08-30 02:31:36,723 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-30 02:31:36,731 INFO L137 encePairwiseOnDemand]: 354/358 looper letters, 22 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-08-30 02:31:36,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 146 flow [2023-08-30 02:31:36,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:31:36,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:31:36,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 461 transitions. [2023-08-30 02:31:36,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4292364990689013 [2023-08-30 02:31:36,734 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 461 transitions. [2023-08-30 02:31:36,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 461 transitions. [2023-08-30 02:31:36,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:36,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 461 transitions. [2023-08-30 02:31:36,735 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-30 02:31:36,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:36,737 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:36,737 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 106 flow. Second operand 3 states and 461 transitions. [2023-08-30 02:31:36,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 146 flow [2023-08-30 02:31:36,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 145 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:31:36,738 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 101 flow [2023-08-30 02:31:36,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, 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-30 02:31:36,739 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2023-08-30 02:31:36,739 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 101 flow [2023-08-30 02:31:36,739 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-30 02:31:36,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:36,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:31:36,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-30 02:31:36,739 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-08-30 02:31:36,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:36,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1063264242, now seen corresponding path program 1 times [2023-08-30 02:31:36,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:36,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835311558] [2023-08-30 02:31:36,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:36,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:36,863 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-30 02:31:36,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:36,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835311558] [2023-08-30 02:31:36,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835311558] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:31:36,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:31:36,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:31:36,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477593056] [2023-08-30 02:31:36,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:31:36,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:31:36,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:36,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:31:36,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:31:36,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 358 [2023-08-30 02:31:36,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 148.0) internal successors, (740), 5 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:36,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:36,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 358 [2023-08-30 02:31:36,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:37,307 INFO L130 PetriNetUnfolder]: 2231/3875 cut-off events. [2023-08-30 02:31:37,307 INFO L131 PetriNetUnfolder]: For 198/198 co-relation queries the response was YES. [2023-08-30 02:31:37,315 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-30 02:31:37,328 INFO L137 encePairwiseOnDemand]: 354/358 looper letters, 39 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2023-08-30 02:31:37,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 233 flow [2023-08-30 02:31:37,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:31:37,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:31:37,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 631 transitions. [2023-08-30 02:31:37,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44064245810055863 [2023-08-30 02:31:37,331 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 631 transitions. [2023-08-30 02:31:37,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 631 transitions. [2023-08-30 02:31:37,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:37,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 631 transitions. [2023-08-30 02:31:37,333 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-30 02:31:37,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 358.0) internal successors, (1790), 5 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:37,335 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 358.0) internal successors, (1790), 5 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:37,335 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 101 flow. Second operand 4 states and 631 transitions. [2023-08-30 02:31:37,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 233 flow [2023-08-30 02:31:37,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:31:37,336 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 114 flow [2023-08-30 02:31:37,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, 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-30 02:31:37,337 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2023-08-30 02:31:37,337 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 114 flow [2023-08-30 02:31:37,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 148.0) internal successors, (740), 5 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:37,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:37,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 02:31:37,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-30 02:31:37,338 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-08-30 02:31:37,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:37,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1398542076, now seen corresponding path program 1 times [2023-08-30 02:31:37,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:37,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123086934] [2023-08-30 02:31:37,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:37,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:37,530 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-30 02:31:37,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:37,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123086934] [2023-08-30 02:31:37,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123086934] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:31:37,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976831182] [2023-08-30 02:31:37,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:37,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:31:37,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:31:37,533 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-30 02:31:37,535 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-30 02:31:37,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:37,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-30 02:31:37,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:31:37,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:31:37,609 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-30 02:31:37,725 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-30 02:31:37,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:31:37,826 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-30 02:31:37,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976831182] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:31:37,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:31:37,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2023-08-30 02:31:37,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316361681] [2023-08-30 02:31:37,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:31:37,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-30 02:31:37,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:37,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-30 02:31:37,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-08-30 02:31:38,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 358 [2023-08-30 02:31:38,348 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-30 02:31:38,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:38,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 358 [2023-08-30 02:31:38,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:38,971 INFO L130 PetriNetUnfolder]: 3097/5300 cut-off events. [2023-08-30 02:31:38,971 INFO L131 PetriNetUnfolder]: For 660/660 co-relation queries the response was YES. [2023-08-30 02:31:38,984 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 358. Compared 37714 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-30 02:31:39,034 INFO L137 encePairwiseOnDemand]: 354/358 looper letters, 71 selfloop transitions, 5 changer transitions 0/94 dead transitions. [2023-08-30 02:31:39,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 94 transitions, 402 flow [2023-08-30 02:31:39,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:31:39,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:31:39,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 953 transitions. [2023-08-30 02:31:39,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4436685288640596 [2023-08-30 02:31:39,037 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 953 transitions. [2023-08-30 02:31:39,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 953 transitions. [2023-08-30 02:31:39,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:39,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 953 transitions. [2023-08-30 02:31:39,040 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-30 02:31:39,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 358.0) internal successors, (2506), 7 states have internal predecessors, (2506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:39,044 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 358.0) internal successors, (2506), 7 states have internal predecessors, (2506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:39,044 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 114 flow. Second operand 6 states and 953 transitions. [2023-08-30 02:31:39,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 94 transitions, 402 flow [2023-08-30 02:31:39,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 94 transitions, 398 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:31:39,046 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 128 flow [2023-08-30 02:31:39,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, 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-30 02:31:39,047 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2023-08-30 02:31:39,047 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 128 flow [2023-08-30 02:31:39,051 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-30 02:31:39,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:39,051 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-30 02:31:39,059 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-30 02:31:39,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:31:39,257 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-08-30 02:31:39,257 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:39,257 INFO L85 PathProgramCache]: Analyzing trace with hash -405126606, now seen corresponding path program 2 times [2023-08-30 02:31:39,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:39,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245325426] [2023-08-30 02:31:39,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:39,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:39,331 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-30 02:31:39,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:39,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245325426] [2023-08-30 02:31:39,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245325426] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:31:39,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598574577] [2023-08-30 02:31:39,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:31:39,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:31:39,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:31:39,333 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-30 02:31:39,335 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-30 02:31:39,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 02:31:39,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:31:39,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 02:31:39,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:31:39,411 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-30 02:31:39,411 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:31:39,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598574577] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:31:39,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 02:31:39,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-30 02:31:39,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643127571] [2023-08-30 02:31:39,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:31:39,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:31:39,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:39,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:31:39,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:31:39,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 358 [2023-08-30 02:31:39,434 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-30 02:31:39,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:39,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 358 [2023-08-30 02:31:39,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:39,875 INFO L130 PetriNetUnfolder]: 2865/5092 cut-off events. [2023-08-30 02:31:39,875 INFO L131 PetriNetUnfolder]: For 525/525 co-relation queries the response was YES. [2023-08-30 02:31:39,886 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 38365 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-30 02:31:39,905 INFO L137 encePairwiseOnDemand]: 354/358 looper letters, 65 selfloop transitions, 5 changer transitions 0/88 dead transitions. [2023-08-30 02:31:39,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 88 transitions, 380 flow [2023-08-30 02:31:39,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:31:39,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:31:39,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 822 transitions. [2023-08-30 02:31:39,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4592178770949721 [2023-08-30 02:31:39,908 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 822 transitions. [2023-08-30 02:31:39,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 822 transitions. [2023-08-30 02:31:39,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:39,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 822 transitions. [2023-08-30 02:31:39,910 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-30 02:31:39,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 358.0) internal successors, (2148), 6 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:39,912 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 358.0) internal successors, (2148), 6 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:39,912 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 128 flow. Second operand 5 states and 822 transitions. [2023-08-30 02:31:39,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 88 transitions, 380 flow [2023-08-30 02:31:39,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 88 transitions, 368 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-08-30 02:31:39,918 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 120 flow [2023-08-30 02:31:39,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, 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-30 02:31:39,919 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 1 predicate places. [2023-08-30 02:31:39,919 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 120 flow [2023-08-30 02:31:39,919 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-30 02:31:39,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:39,919 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:31:39,926 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-30 02:31:40,126 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,SelfDestructingSolverStorable22 [2023-08-30 02:31:40,126 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-08-30 02:31:40,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:40,127 INFO L85 PathProgramCache]: Analyzing trace with hash -951272975, now seen corresponding path program 1 times [2023-08-30 02:31:40,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:40,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426174655] [2023-08-30 02:31:40,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:40,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:40,278 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-30 02:31:40,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:40,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426174655] [2023-08-30 02:31:40,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426174655] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:31:40,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926908316] [2023-08-30 02:31:40,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:40,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:31:40,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:31:40,281 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-30 02:31:40,283 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-30 02:31:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:40,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-30 02:31:40,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:31:40,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:31:40,363 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-30 02:31:40,470 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-30 02:31:40,470 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:31:40,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926908316] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:31:40,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 02:31:40,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-30 02:31:40,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498264729] [2023-08-30 02:31:40,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:31:40,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:31:40,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:40,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:31:40,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:31:40,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 358 [2023-08-30 02:31:40,532 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-30 02:31:40,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:40,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 358 [2023-08-30 02:31:40,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:41,107 INFO L130 PetriNetUnfolder]: 4625/7966 cut-off events. [2023-08-30 02:31:41,107 INFO L131 PetriNetUnfolder]: For 1812/1812 co-relation queries the response was YES. [2023-08-30 02:31:41,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15760 conditions, 7966 events. 4625/7966 cut-off events. For 1812/1812 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 60248 event pairs, 2255 based on Foata normal form. 0/6472 useless extension candidates. Maximal degree in co-relation 15749. Up to 3713 conditions per place. [2023-08-30 02:31:41,158 INFO L137 encePairwiseOnDemand]: 354/358 looper letters, 42 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2023-08-30 02:31:41,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 63 transitions, 271 flow [2023-08-30 02:31:41,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:31:41,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:31:41,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 644 transitions. [2023-08-30 02:31:41,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44972067039106145 [2023-08-30 02:31:41,160 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 644 transitions. [2023-08-30 02:31:41,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 644 transitions. [2023-08-30 02:31:41,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:41,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 644 transitions. [2023-08-30 02:31:41,162 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-30 02:31:41,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 358.0) internal successors, (1790), 5 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:41,176 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 358.0) internal successors, (1790), 5 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:41,176 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 120 flow. Second operand 4 states and 644 transitions. [2023-08-30 02:31:41,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 63 transitions, 271 flow [2023-08-30 02:31:41,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 63 transitions, 253 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-30 02:31:41,178 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 125 flow [2023-08-30 02:31:41,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, 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-30 02:31:41,179 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2023-08-30 02:31:41,179 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 125 flow [2023-08-30 02:31:41,180 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-30 02:31:41,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:41,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:31:41,189 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-30 02:31:41,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:31:41,385 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-08-30 02:31:41,385 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:41,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1441384109, now seen corresponding path program 1 times [2023-08-30 02:31:41,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:41,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954472934] [2023-08-30 02:31:41,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:41,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:41,408 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-30 02:31:41,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:41,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954472934] [2023-08-30 02:31:41,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954472934] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:31:41,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:31:41,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:31:41,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826567486] [2023-08-30 02:31:41,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:31:41,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:31:41,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:41,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:31:41,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:31:41,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 358 [2023-08-30 02:31:41,420 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-30 02:31:41,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:41,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 358 [2023-08-30 02:31:41,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:41,712 INFO L130 PetriNetUnfolder]: 2557/4205 cut-off events. [2023-08-30 02:31:41,712 INFO L131 PetriNetUnfolder]: For 999/999 co-relation queries the response was YES. [2023-08-30 02:31:41,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8804 conditions, 4205 events. 2557/4205 cut-off events. For 999/999 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 26888 event pairs, 1439 based on Foata normal form. 142/3728 useless extension candidates. Maximal degree in co-relation 8791. Up to 2908 conditions per place. [2023-08-30 02:31:41,735 INFO L137 encePairwiseOnDemand]: 355/358 looper letters, 39 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-08-30 02:31:41,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 255 flow [2023-08-30 02:31:41,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:31:41,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:31:41,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2023-08-30 02:31:41,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4581005586592179 [2023-08-30 02:31:41,737 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 492 transitions. [2023-08-30 02:31:41,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 492 transitions. [2023-08-30 02:31:41,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:41,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 492 transitions. [2023-08-30 02:31:41,739 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-30 02:31:41,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:41,740 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:41,740 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 125 flow. Second operand 3 states and 492 transitions. [2023-08-30 02:31:41,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 255 flow [2023-08-30 02:31:41,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 59 transitions, 249 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:31:41,742 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 121 flow [2023-08-30 02:31:41,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, 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-30 02:31:41,743 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2023-08-30 02:31:41,743 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 121 flow [2023-08-30 02:31:41,743 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-30 02:31:41,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:41,743 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:31:41,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-30 02:31:41,744 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-08-30 02:31:41,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:41,744 INFO L85 PathProgramCache]: Analyzing trace with hash 575313807, now seen corresponding path program 1 times [2023-08-30 02:31:41,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:41,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88971717] [2023-08-30 02:31:41,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:41,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:41,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 02:31:41,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:41,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88971717] [2023-08-30 02:31:41,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88971717] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:31:41,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4898204] [2023-08-30 02:31:41,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:41,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:31:41,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:31:41,902 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-30 02:31:41,905 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-30 02:31:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:41,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-30 02:31:41,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:31:41,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:31:41,989 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-30 02:31:42,111 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-30 02:31:42,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:31:42,197 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-30 02:31:42,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4898204] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:31:42,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:31:42,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2023-08-30 02:31:42,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112749783] [2023-08-30 02:31:42,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:31:42,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-30 02:31:42,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:42,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-30 02:31:42,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-08-30 02:31:42,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 358 [2023-08-30 02:31:42,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 121 flow. Second operand has 12 states, 12 states have (on average 145.83333333333334) internal successors, (1750), 12 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:42,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:42,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 358 [2023-08-30 02:31:42,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:42,959 INFO L130 PetriNetUnfolder]: 2845/4759 cut-off events. [2023-08-30 02:31:42,959 INFO L131 PetriNetUnfolder]: For 1047/1047 co-relation queries the response was YES. [2023-08-30 02:31:42,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10034 conditions, 4759 events. 2845/4759 cut-off events. For 1047/1047 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 31626 event pairs, 1091 based on Foata normal form. 98/4208 useless extension candidates. Maximal degree in co-relation 10022. Up to 2047 conditions per place. [2023-08-30 02:31:42,983 INFO L137 encePairwiseOnDemand]: 353/358 looper letters, 55 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2023-08-30 02:31:42,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 77 transitions, 337 flow [2023-08-30 02:31:42,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:31:42,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:31:42,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 775 transitions. [2023-08-30 02:31:42,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4329608938547486 [2023-08-30 02:31:42,986 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 775 transitions. [2023-08-30 02:31:42,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 775 transitions. [2023-08-30 02:31:42,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:42,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 775 transitions. [2023-08-30 02:31:42,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 155.0) internal successors, (775), 5 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:42,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 358.0) internal successors, (2148), 6 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:42,990 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 358.0) internal successors, (2148), 6 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:42,991 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 121 flow. Second operand 5 states and 775 transitions. [2023-08-30 02:31:42,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 77 transitions, 337 flow [2023-08-30 02:31:42,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 77 transitions, 323 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:31:42,993 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 137 flow [2023-08-30 02:31:42,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=115, 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=137, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2023-08-30 02:31:42,994 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2023-08-30 02:31:42,994 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 137 flow [2023-08-30 02:31:42,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 145.83333333333334) internal successors, (1750), 12 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:42,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:42,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:31:43,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-30 02:31:43,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:31:43,200 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-08-30 02:31:43,201 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:43,201 INFO L85 PathProgramCache]: Analyzing trace with hash -337985857, now seen corresponding path program 1 times [2023-08-30 02:31:43,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:43,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037735146] [2023-08-30 02:31:43,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:43,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:43,220 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-30 02:31:43,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:43,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037735146] [2023-08-30 02:31:43,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037735146] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:31:43,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:31:43,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:31:43,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475203072] [2023-08-30 02:31:43,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:31:43,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:31:43,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:43,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:31:43,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:31:43,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 358 [2023-08-30 02:31:43,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 137 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-30 02:31:43,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:43,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 358 [2023-08-30 02:31:43,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:43,893 INFO L130 PetriNetUnfolder]: 5806/9210 cut-off events. [2023-08-30 02:31:43,894 INFO L131 PetriNetUnfolder]: For 3191/3191 co-relation queries the response was YES. [2023-08-30 02:31:43,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20223 conditions, 9210 events. 5806/9210 cut-off events. For 3191/3191 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 63692 event pairs, 3001 based on Foata normal form. 0/7816 useless extension candidates. Maximal degree in co-relation 20208. Up to 5766 conditions per place. [2023-08-30 02:31:43,931 INFO L137 encePairwiseOnDemand]: 352/358 looper letters, 48 selfloop transitions, 5 changer transitions 0/65 dead transitions. [2023-08-30 02:31:43,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 65 transitions, 319 flow [2023-08-30 02:31:43,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:31:43,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:31:43,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2023-08-30 02:31:43,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45251396648044695 [2023-08-30 02:31:43,933 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 486 transitions. [2023-08-30 02:31:43,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 486 transitions. [2023-08-30 02:31:43,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:43,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 486 transitions. [2023-08-30 02:31:43,934 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-30 02:31:43,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:43,936 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:43,936 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 137 flow. Second operand 3 states and 486 transitions. [2023-08-30 02:31:43,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 65 transitions, 319 flow [2023-08-30 02:31:43,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 305 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-30 02:31:43,940 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 163 flow [2023-08-30 02:31:43,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=52, 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=163, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-08-30 02:31:43,941 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2023-08-30 02:31:43,941 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 163 flow [2023-08-30 02:31:43,941 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-30 02:31:43,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:43,941 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:31:43,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-30 02:31:43,941 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-08-30 02:31:43,942 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:43,942 INFO L85 PathProgramCache]: Analyzing trace with hash 654863793, now seen corresponding path program 2 times [2023-08-30 02:31:43,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:43,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216941164] [2023-08-30 02:31:43,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:43,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:43,980 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-30 02:31:43,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:43,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216941164] [2023-08-30 02:31:43,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216941164] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:31:43,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998270820] [2023-08-30 02:31:43,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:31:43,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:31:43,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:31:43,985 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-30 02:31:44,012 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-30 02:31:44,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 02:31:44,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:31:44,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 02:31:44,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:31:44,077 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-30 02:31:44,077 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:31:44,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998270820] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:31:44,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 02:31:44,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-30 02:31:44,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422061162] [2023-08-30 02:31:44,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:31:44,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:31:44,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:44,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:31:44,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:31:44,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 358 [2023-08-30 02:31:44,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 163 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-30 02:31:44,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:44,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 358 [2023-08-30 02:31:44,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:44,524 INFO L130 PetriNetUnfolder]: 3184/5783 cut-off events. [2023-08-30 02:31:44,524 INFO L131 PetriNetUnfolder]: For 1551/1615 co-relation queries the response was YES. [2023-08-30 02:31:44,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12268 conditions, 5783 events. 3184/5783 cut-off events. For 1551/1615 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 44119 event pairs, 149 based on Foata normal form. 112/5264 useless extension candidates. Maximal degree in co-relation 12253. Up to 3177 conditions per place. [2023-08-30 02:31:44,547 INFO L137 encePairwiseOnDemand]: 354/358 looper letters, 70 selfloop transitions, 4 changer transitions 0/94 dead transitions. [2023-08-30 02:31:44,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 94 transitions, 447 flow [2023-08-30 02:31:44,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:31:44,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:31:44,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 814 transitions. [2023-08-30 02:31:44,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4547486033519553 [2023-08-30 02:31:44,550 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 814 transitions. [2023-08-30 02:31:44,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 814 transitions. [2023-08-30 02:31:44,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:44,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 814 transitions. [2023-08-30 02:31:44,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:44,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 358.0) internal successors, (2148), 6 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:44,554 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 358.0) internal successors, (2148), 6 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:44,554 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 163 flow. Second operand 5 states and 814 transitions. [2023-08-30 02:31:44,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 94 transitions, 447 flow [2023-08-30 02:31:44,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 94 transitions, 427 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:31:44,559 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 154 flow [2023-08-30 02:31:44,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2023-08-30 02:31:44,560 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2023-08-30 02:31:44,560 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 154 flow [2023-08-30 02:31:44,560 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-30 02:31:44,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:44,560 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 02:31:44,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-30 02:31:44,766 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,SelfDestructingSolverStorable27 [2023-08-30 02:31:44,766 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-08-30 02:31:44,767 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:44,767 INFO L85 PathProgramCache]: Analyzing trace with hash -198199376, now seen corresponding path program 1 times [2023-08-30 02:31:44,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:44,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464373495] [2023-08-30 02:31:44,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:44,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:44,911 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-30 02:31:44,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:44,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464373495] [2023-08-30 02:31:44,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464373495] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:31:44,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:31:44,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:31:44,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168653666] [2023-08-30 02:31:44,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:31:44,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:31:44,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:44,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:31:44,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:31:44,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 358 [2023-08-30 02:31:44,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 154 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-30 02:31:44,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:44,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 358 [2023-08-30 02:31:44,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:45,427 INFO L130 PetriNetUnfolder]: 3560/6228 cut-off events. [2023-08-30 02:31:45,427 INFO L131 PetriNetUnfolder]: For 2575/2664 co-relation queries the response was YES. [2023-08-30 02:31:45,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13813 conditions, 6228 events. 3560/6228 cut-off events. For 2575/2664 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 44649 event pairs, 2457 based on Foata normal form. 0/5533 useless extension candidates. Maximal degree in co-relation 13799. Up to 4237 conditions per place. [2023-08-30 02:31:45,450 INFO L137 encePairwiseOnDemand]: 353/358 looper letters, 40 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2023-08-30 02:31:45,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 63 transitions, 304 flow [2023-08-30 02:31:45,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:31:45,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:31:45,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 631 transitions. [2023-08-30 02:31:45,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44064245810055863 [2023-08-30 02:31:45,452 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 631 transitions. [2023-08-30 02:31:45,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 631 transitions. [2023-08-30 02:31:45,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:45,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 631 transitions. [2023-08-30 02:31:45,454 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-30 02:31:45,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 358.0) internal successors, (1790), 5 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:45,456 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 358.0) internal successors, (1790), 5 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:45,456 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 154 flow. Second operand 4 states and 631 transitions. [2023-08-30 02:31:45,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 63 transitions, 304 flow [2023-08-30 02:31:45,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 63 transitions, 286 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-30 02:31:45,459 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 161 flow [2023-08-30 02:31:45,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2023-08-30 02:31:45,459 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 8 predicate places. [2023-08-30 02:31:45,460 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 161 flow [2023-08-30 02:31:45,460 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-30 02:31:45,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:45,460 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:31:45,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-30 02:31:45,460 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-08-30 02:31:45,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:45,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1849207708, now seen corresponding path program 1 times [2023-08-30 02:31:45,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:45,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775183522] [2023-08-30 02:31:45,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:45,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:45,653 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-30 02:31:45,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:45,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775183522] [2023-08-30 02:31:45,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775183522] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:31:45,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704327531] [2023-08-30 02:31:45,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:45,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:31:45,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:31:45,654 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-30 02:31:45,655 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-30 02:31:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:45,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-30 02:31:45,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:31:45,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:31:45,741 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-30 02:31:45,861 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-30 02:31:45,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:31:45,949 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-30 02:31:45,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704327531] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:31:45,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:31:45,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2023-08-30 02:31:45,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874141267] [2023-08-30 02:31:45,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:31:45,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-30 02:31:45,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:45,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-30 02:31:45,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-08-30 02:31:46,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 358 [2023-08-30 02:31:46,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 161 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-30 02:31:46,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:46,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 358 [2023-08-30 02:31:46,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:46,863 INFO L130 PetriNetUnfolder]: 3862/6744 cut-off events. [2023-08-30 02:31:46,863 INFO L131 PetriNetUnfolder]: For 2181/2266 co-relation queries the response was YES. [2023-08-30 02:31:46,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15526 conditions, 6744 events. 3862/6744 cut-off events. For 2181/2266 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 48886 event pairs, 1647 based on Foata normal form. 0/6032 useless extension candidates. Maximal degree in co-relation 15510. Up to 2941 conditions per place. [2023-08-30 02:31:46,894 INFO L137 encePairwiseOnDemand]: 354/358 looper letters, 59 selfloop transitions, 4 changer transitions 0/83 dead transitions. [2023-08-30 02:31:46,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 83 transitions, 405 flow [2023-08-30 02:31:46,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:31:46,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:31:46,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 769 transitions. [2023-08-30 02:31:46,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42960893854748605 [2023-08-30 02:31:46,897 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 769 transitions. [2023-08-30 02:31:46,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 769 transitions. [2023-08-30 02:31:46,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:46,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 769 transitions. [2023-08-30 02:31:46,898 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-30 02:31:46,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 358.0) internal successors, (2148), 6 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:46,900 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 358.0) internal successors, (2148), 6 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:46,901 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 161 flow. Second operand 5 states and 769 transitions. [2023-08-30 02:31:46,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 83 transitions, 405 flow [2023-08-30 02:31:46,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 83 transitions, 399 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:31:46,907 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 173 flow [2023-08-30 02:31:46,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=55, 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=173, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2023-08-30 02:31:46,908 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 11 predicate places. [2023-08-30 02:31:46,908 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 173 flow [2023-08-30 02:31:46,908 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-30 02:31:46,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:46,908 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:31:46,916 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-30 02:31:47,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:31:47,113 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-08-30 02:31:47,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:47,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1220776381, now seen corresponding path program 1 times [2023-08-30 02:31:47,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:47,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307612455] [2023-08-30 02:31:47,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:47,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:47,139 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-30 02:31:47,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:47,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307612455] [2023-08-30 02:31:47,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307612455] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:31:47,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:31:47,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:31:47,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497319128] [2023-08-30 02:31:47,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:31:47,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:31:47,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:47,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:31:47,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:31:47,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 358 [2023-08-30 02:31:47,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 173 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-30 02:31:47,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:47,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 358 [2023-08-30 02:31:47,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:47,997 INFO L130 PetriNetUnfolder]: 7504/12138 cut-off events. [2023-08-30 02:31:47,997 INFO L131 PetriNetUnfolder]: For 4730/4810 co-relation queries the response was YES. [2023-08-30 02:31:48,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29151 conditions, 12138 events. 7504/12138 cut-off events. For 4730/4810 co-relation queries the response was YES. Maximal size of possible extension queue 727. Compared 89034 event pairs, 3735 based on Foata normal form. 0/11245 useless extension candidates. Maximal degree in co-relation 29134. Up to 7140 conditions per place. [2023-08-30 02:31:48,063 INFO L137 encePairwiseOnDemand]: 352/358 looper letters, 52 selfloop transitions, 7 changer transitions 0/71 dead transitions. [2023-08-30 02:31:48,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 71 transitions, 379 flow [2023-08-30 02:31:48,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:31:48,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:31:48,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 483 transitions. [2023-08-30 02:31:48,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44972067039106145 [2023-08-30 02:31:48,065 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 483 transitions. [2023-08-30 02:31:48,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 483 transitions. [2023-08-30 02:31:48,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:48,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 483 transitions. [2023-08-30 02:31:48,065 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-30 02:31:48,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:48,066 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:48,067 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 173 flow. Second operand 3 states and 483 transitions. [2023-08-30 02:31:48,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 71 transitions, 379 flow [2023-08-30 02:31:48,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 71 transitions, 369 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:31:48,077 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 219 flow [2023-08-30 02:31:48,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=57, 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=219, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2023-08-30 02:31:48,077 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2023-08-30 02:31:48,078 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 219 flow [2023-08-30 02:31:48,078 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-30 02:31:48,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:48,078 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2023-08-30 02:31:48,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-08-30 02:31:48,078 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-08-30 02:31:48,078 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:48,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1502236618, now seen corresponding path program 1 times [2023-08-30 02:31:48,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:48,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569927928] [2023-08-30 02:31:48,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:48,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:31:48,086 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:31:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:31:48,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:31:48,093 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:31:48,093 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2023-08-30 02:31:48,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2023-08-30 02:31:48,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 02:31:48,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (12 of 16 remaining) [2023-08-30 02:31:48,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 02:31:48,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 02:31:48,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (9 of 16 remaining) [2023-08-30 02:31:48,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 02:31:48,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 02:31:48,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (6 of 16 remaining) [2023-08-30 02:31:48,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2023-08-30 02:31:48,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2023-08-30 02:31:48,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (3 of 16 remaining) [2023-08-30 02:31:48,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 16 remaining) [2023-08-30 02:31:48,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2023-08-30 02:31:48,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 02:31:48,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-08-30 02:31:48,095 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:31:48,095 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-30 02:31:48,096 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-08-30 02:31:48,118 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:31:48,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 207 places, 227 transitions, 486 flow [2023-08-30 02:31:48,143 INFO L130 PetriNetUnfolder]: 33/293 cut-off events. [2023-08-30 02:31:48,144 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-30 02:31:48,145 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-30 02:31:48,145 INFO L82 GeneralOperation]: Start removeDead. Operand has 207 places, 227 transitions, 486 flow [2023-08-30 02:31:48,148 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 227 transitions, 486 flow [2023-08-30 02:31:48,148 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:31:48,148 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 207 places, 227 transitions, 486 flow [2023-08-30 02:31:48,148 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 207 places, 227 transitions, 486 flow [2023-08-30 02:31:48,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 207 places, 227 transitions, 486 flow [2023-08-30 02:31:48,175 INFO L130 PetriNetUnfolder]: 33/293 cut-off events. [2023-08-30 02:31:48,175 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-30 02:31:48,177 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-30 02:31:48,191 INFO L119 LiptonReduction]: Number of co-enabled transitions 32568 [2023-08-30 02:31:51,994 INFO L134 LiptonReduction]: Checked pairs total: 50618 [2023-08-30 02:31:51,995 INFO L136 LiptonReduction]: Total number of compositions: 221 [2023-08-30 02:31:52,000 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:31:52,001 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;@7dd0f6e4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:31:52,001 INFO L358 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2023-08-30 02:31:52,002 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 02:31:52,002 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:31:52,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:52,002 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 02:31:52,003 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2023-08-30 02:31:52,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:52,003 INFO L85 PathProgramCache]: Analyzing trace with hash 51653, now seen corresponding path program 1 times [2023-08-30 02:31:52,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:52,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4128248] [2023-08-30 02:31:52,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:52,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:52,015 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-30 02:31:52,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:52,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4128248] [2023-08-30 02:31:52,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4128248] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:31:52,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:31:52,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:31:52,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441818672] [2023-08-30 02:31:52,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:31:52,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:31:52,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:52,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:31:52,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:31:52,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 448 [2023-08-30 02:31:52,017 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-30 02:31:52,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:52,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 448 [2023-08-30 02:31:52,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:55,721 INFO L130 PetriNetUnfolder]: 42152/60736 cut-off events. [2023-08-30 02:31:55,721 INFO L131 PetriNetUnfolder]: For 5321/5321 co-relation queries the response was YES. [2023-08-30 02:31:55,824 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 453309 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-30 02:31:56,074 INFO L137 encePairwiseOnDemand]: 438/448 looper letters, 36 selfloop transitions, 0 changer transitions 0/59 dead transitions. [2023-08-30 02:31:56,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 59 transitions, 222 flow [2023-08-30 02:31:56,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:31:56,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:31:56,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 440 transitions. [2023-08-30 02:31:56,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49107142857142855 [2023-08-30 02:31:56,075 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 440 transitions. [2023-08-30 02:31:56,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 440 transitions. [2023-08-30 02:31:56,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:56,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 440 transitions. [2023-08-30 02:31:56,076 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-30 02:31:56,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 448.0) internal successors, (1344), 3 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:56,077 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 448.0) internal successors, (1344), 3 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:56,078 INFO L175 Difference]: Start difference. First operand has 62 places, 69 transitions, 170 flow. Second operand 2 states and 440 transitions. [2023-08-30 02:31:56,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 59 transitions, 222 flow [2023-08-30 02:31:56,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 59 transitions, 210 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-08-30 02:31:56,082 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 138 flow [2023-08-30 02:31:56,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, 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-30 02:31:56,082 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2023-08-30 02:31:56,083 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 138 flow [2023-08-30 02:31:56,083 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-30 02:31:56,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:56,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 02:31:56,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-08-30 02:31:56,083 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2023-08-30 02:31:56,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:56,084 INFO L85 PathProgramCache]: Analyzing trace with hash 51638, now seen corresponding path program 1 times [2023-08-30 02:31:56,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:56,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615662977] [2023-08-30 02:31:56,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:56,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:56,106 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-30 02:31:56,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:56,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615662977] [2023-08-30 02:31:56,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615662977] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:31:56,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:31:56,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:31:56,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715733125] [2023-08-30 02:31:56,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:31:56,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:31:56,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:56,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:31:56,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:31:56,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 448 [2023-08-30 02:31:56,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 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-30 02:31:56,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:56,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 448 [2023-08-30 02:31:56,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:31:59,071 INFO L130 PetriNetUnfolder]: 31014/45197 cut-off events. [2023-08-30 02:31:59,072 INFO L131 PetriNetUnfolder]: For 1099/1099 co-relation queries the response was YES. [2023-08-30 02:31:59,162 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 329537 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-30 02:31:59,328 INFO L137 encePairwiseOnDemand]: 446/448 looper letters, 34 selfloop transitions, 1 changer transitions 0/58 dead transitions. [2023-08-30 02:31:59,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 206 flow [2023-08-30 02:31:59,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:31:59,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:31:59,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 615 transitions. [2023-08-30 02:31:59,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4575892857142857 [2023-08-30 02:31:59,330 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 615 transitions. [2023-08-30 02:31:59,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 615 transitions. [2023-08-30 02:31:59,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:31:59,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 615 transitions. [2023-08-30 02:31:59,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:59,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 448.0) internal successors, (1792), 4 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:59,332 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 448.0) internal successors, (1792), 4 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:31:59,333 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 138 flow. Second operand 3 states and 615 transitions. [2023-08-30 02:31:59,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 206 flow [2023-08-30 02:31:59,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 58 transitions, 206 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:31:59,334 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 138 flow [2023-08-30 02:31:59,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, 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-30 02:31:59,335 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 0 predicate places. [2023-08-30 02:31:59,335 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 138 flow [2023-08-30 02:31:59,335 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-30 02:31:59,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:31:59,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 02:31:59,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-08-30 02:31:59,336 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2023-08-30 02:31:59,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:31:59,336 INFO L85 PathProgramCache]: Analyzing trace with hash 51640, now seen corresponding path program 1 times [2023-08-30 02:31:59,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:31:59,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482359394] [2023-08-30 02:31:59,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:31:59,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:31:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:31:59,352 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-30 02:31:59,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:31:59,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482359394] [2023-08-30 02:31:59,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482359394] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:31:59,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:31:59,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:31:59,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118782895] [2023-08-30 02:31:59,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:31:59,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:31:59,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:31:59,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:31:59,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:31:59,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 448 [2023-08-30 02:31:59,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 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-30 02:31:59,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:31:59,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 448 [2023-08-30 02:31:59,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:32:01,357 INFO L130 PetriNetUnfolder]: 19876/29658 cut-off events. [2023-08-30 02:32:01,358 INFO L131 PetriNetUnfolder]: For 1099/1099 co-relation queries the response was YES. [2023-08-30 02:32:01,408 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 210575 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-30 02:32:01,513 INFO L137 encePairwiseOnDemand]: 446/448 looper letters, 33 selfloop transitions, 1 changer transitions 0/57 dead transitions. [2023-08-30 02:32:01,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 57 transitions, 204 flow [2023-08-30 02:32:01,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:32:01,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:32:01,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 608 transitions. [2023-08-30 02:32:01,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2023-08-30 02:32:01,516 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 608 transitions. [2023-08-30 02:32:01,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 608 transitions. [2023-08-30 02:32:01,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:32:01,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 608 transitions. [2023-08-30 02:32:01,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:32:01,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 448.0) internal successors, (1792), 4 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:32:01,520 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 448.0) internal successors, (1792), 4 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:32:01,520 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 138 flow. Second operand 3 states and 608 transitions. [2023-08-30 02:32:01,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 57 transitions, 204 flow [2023-08-30 02:32:01,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 57 transitions, 203 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:32:01,522 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 137 flow [2023-08-30 02:32:01,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, 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-30 02:32:01,522 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 0 predicate places. [2023-08-30 02:32:01,522 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 137 flow [2023-08-30 02:32:01,523 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-30 02:32:01,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:32:01,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:32:01,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-08-30 02:32:01,523 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2023-08-30 02:32:01,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:32:01,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1539743885, now seen corresponding path program 1 times [2023-08-30 02:32:01,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:32:01,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911541137] [2023-08-30 02:32:01,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:32:01,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:32:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:32:01,562 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-30 02:32:01,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:32:01,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911541137] [2023-08-30 02:32:01,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911541137] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:32:01,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:32:01,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:32:01,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765447904] [2023-08-30 02:32:01,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:32:01,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:32:01,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:32:01,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:32:01,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:32:01,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 448 [2023-08-30 02:32:01,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 137 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-30 02:32:01,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:32:01,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 448 [2023-08-30 02:32:01,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:32:02,792 INFO L130 PetriNetUnfolder]: 11043/16837 cut-off events. [2023-08-30 02:32:02,793 INFO L131 PetriNetUnfolder]: For 702/702 co-relation queries the response was YES. [2023-08-30 02:32:02,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31438 conditions, 16837 events. 11043/16837 cut-off events. For 702/702 co-relation queries the response was YES. Maximal size of possible extension queue 834. Compared 113649 event pairs, 8555 based on Foata normal form. 0/12120 useless extension candidates. Maximal degree in co-relation 31430. Up to 13635 conditions per place. [2023-08-30 02:32:02,881 INFO L137 encePairwiseOnDemand]: 443/448 looper letters, 29 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2023-08-30 02:32:02,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 53 transitions, 189 flow [2023-08-30 02:32:02,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:32:02,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:32:02,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions. [2023-08-30 02:32:02,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43154761904761907 [2023-08-30 02:32:02,883 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 580 transitions. [2023-08-30 02:32:02,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 580 transitions. [2023-08-30 02:32:02,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:32:02,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 580 transitions. [2023-08-30 02:32:02,884 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-30 02:32:02,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 448.0) internal successors, (1792), 4 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:32:02,886 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 448.0) internal successors, (1792), 4 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:32:02,886 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 137 flow. Second operand 3 states and 580 transitions. [2023-08-30 02:32:02,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 53 transitions, 189 flow [2023-08-30 02:32:02,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 53 transitions, 188 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:32:02,888 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 130 flow [2023-08-30 02:32:02,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2023-08-30 02:32:02,889 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2023-08-30 02:32:02,889 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 130 flow [2023-08-30 02:32:02,889 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-30 02:32:02,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:32:02,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:32:02,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-08-30 02:32:02,890 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2023-08-30 02:32:02,890 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:32:02,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1539743886, now seen corresponding path program 1 times [2023-08-30 02:32:02,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:32:02,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067456014] [2023-08-30 02:32:02,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:32:02,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:32:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:32:03,018 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-30 02:32:03,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:32:03,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067456014] [2023-08-30 02:32:03,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067456014] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:32:03,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:32:03,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:32:03,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901246934] [2023-08-30 02:32:03,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:32:03,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:32:03,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:32:03,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:32:03,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:32:03,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 448 [2023-08-30 02:32:03,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 130 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-30 02:32:03,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:32:03,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 448 [2023-08-30 02:32:03,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:32:04,222 INFO L130 PetriNetUnfolder]: 12857/18901 cut-off events. [2023-08-30 02:32:04,222 INFO L131 PetriNetUnfolder]: For 831/831 co-relation queries the response was YES. [2023-08-30 02:32:04,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35904 conditions, 18901 events. 12857/18901 cut-off events. For 831/831 co-relation queries the response was YES. Maximal size of possible extension queue 909. Compared 124189 event pairs, 7275 based on Foata normal form. 0/13638 useless extension candidates. Maximal degree in co-relation 35896. Up to 13635 conditions per place. [2023-08-30 02:32:04,309 INFO L137 encePairwiseOnDemand]: 443/448 looper letters, 50 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2023-08-30 02:32:04,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 76 transitions, 297 flow [2023-08-30 02:32:04,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:32:04,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:32:04,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 811 transitions. [2023-08-30 02:32:04,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4525669642857143 [2023-08-30 02:32:04,311 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 811 transitions. [2023-08-30 02:32:04,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 811 transitions. [2023-08-30 02:32:04,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:32:04,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 811 transitions. [2023-08-30 02:32:04,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 202.75) internal successors, (811), 4 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:32:04,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 448.0) internal successors, (2240), 5 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:32:04,315 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 448.0) internal successors, (2240), 5 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:32:04,315 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 130 flow. Second operand 4 states and 811 transitions. [2023-08-30 02:32:04,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 76 transitions, 297 flow [2023-08-30 02:32:04,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 76 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:32:04,317 INFO L231 Difference]: Finished difference. Result has 62 places, 54 transitions, 145 flow [2023-08-30 02:32:04,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2023-08-30 02:32:04,318 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 0 predicate places. [2023-08-30 02:32:04,318 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 145 flow [2023-08-30 02:32:04,318 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-30 02:32:04,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:32:04,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 02:32:04,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-08-30 02:32:04,319 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2023-08-30 02:32:04,319 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:32:04,319 INFO L85 PathProgramCache]: Analyzing trace with hash 487425685, now seen corresponding path program 1 times [2023-08-30 02:32:04,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:32:04,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474464371] [2023-08-30 02:32:04,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:32:04,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:32:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:32:04,443 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-30 02:32:04,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:32:04,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474464371] [2023-08-30 02:32:04,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474464371] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:32:04,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938060191] [2023-08-30 02:32:04,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:32:04,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:32:04,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:32:04,453 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-30 02:32:04,457 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-30 02:32:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:32:04,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-30 02:32:04,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:32:04,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:32:04,547 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-30 02:32:04,648 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-30 02:32:04,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:32:04,711 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-30 02:32:04,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938060191] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:32:04,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:32:04,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2023-08-30 02:32:04,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893505649] [2023-08-30 02:32:04,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:32:04,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-30 02:32:04,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:32:04,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-30 02:32:04,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-08-30 02:32:05,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 448 [2023-08-30 02:32:05,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 145 flow. Second operand has 12 states, 12 states have (on average 185.5) internal successors, (2226), 12 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:32:05,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:32:05,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 448 [2023-08-30 02:32:05,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:32:07,601 INFO L130 PetriNetUnfolder]: 20393/30583 cut-off events. [2023-08-30 02:32:07,601 INFO L131 PetriNetUnfolder]: For 3707/3707 co-relation queries the response was YES. [2023-08-30 02:32:07,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61336 conditions, 30583 events. 20393/30583 cut-off events. For 3707/3707 co-relation queries the response was YES. Maximal size of possible extension queue 1497. Compared 225049 event pairs, 7275 based on Foata normal form. 0/22351 useless extension candidates. Maximal degree in co-relation 61327. Up to 13635 conditions per place. [2023-08-30 02:32:07,771 INFO L137 encePairwiseOnDemand]: 444/448 looper letters, 75 selfloop transitions, 4 changer transitions 0/102 dead transitions. [2023-08-30 02:32:07,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 102 transitions, 433 flow [2023-08-30 02:32:07,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:32:07,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:32:07,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1000 transitions. [2023-08-30 02:32:07,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2023-08-30 02:32:07,773 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1000 transitions. [2023-08-30 02:32:07,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1000 transitions. [2023-08-30 02:32:07,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:32:07,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1000 transitions. [2023-08-30 02:32:07,775 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-30 02:32:07,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 448.0) internal successors, (2688), 6 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:32:07,777 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 448.0) internal successors, (2688), 6 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:32:07,777 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 145 flow. Second operand 5 states and 1000 transitions. [2023-08-30 02:32:07,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 102 transitions, 433 flow [2023-08-30 02:32:07,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 102 transitions, 427 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:32:07,779 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 157 flow [2023-08-30 02:32:07,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, 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-30 02:32:07,779 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2023-08-30 02:32:07,779 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 157 flow [2023-08-30 02:32:07,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 185.5) internal successors, (2226), 12 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:32:07,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:32:07,780 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-30 02:32:07,785 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-30 02:32:07,985 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,SelfDestructingSolverStorable37 [2023-08-30 02:32:07,985 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2023-08-30 02:32:07,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:32:07,986 INFO L85 PathProgramCache]: Analyzing trace with hash -2069667474, now seen corresponding path program 2 times [2023-08-30 02:32:07,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:32:07,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402391970] [2023-08-30 02:32:07,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:32:07,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:32:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:32:08,020 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-30 02:32:08,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:32:08,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402391970] [2023-08-30 02:32:08,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402391970] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:32:08,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681640835] [2023-08-30 02:32:08,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:32:08,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:32:08,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:32:08,023 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-30 02:32:08,052 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-30 02:32:08,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 02:32:08,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:32:08,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 02:32:08,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:32:08,122 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-30 02:32:08,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:32:08,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681640835] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:32:08,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 02:32:08,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-30 02:32:08,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747774906] [2023-08-30 02:32:08,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:32:08,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:32:08,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:32:08,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:32:08,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:32:08,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 448 [2023-08-30 02:32:08,141 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-30 02:32:08,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:32:08,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 448 [2023-08-30 02:32:08,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:32:09,909 INFO L130 PetriNetUnfolder]: 18145/28267 cut-off events. [2023-08-30 02:32:09,910 INFO L131 PetriNetUnfolder]: For 3872/3872 co-relation queries the response was YES. [2023-08-30 02:32:09,999 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 222887 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-30 02:32:10,117 INFO L137 encePairwiseOnDemand]: 444/448 looper letters, 93 selfloop transitions, 4 changer transitions 0/120 dead transitions. [2023-08-30 02:32:10,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 120 transitions, 520 flow [2023-08-30 02:32:10,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:32:10,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:32:10,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1049 transitions. [2023-08-30 02:32:10,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46830357142857143 [2023-08-30 02:32:10,119 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1049 transitions. [2023-08-30 02:32:10,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1049 transitions. [2023-08-30 02:32:10,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:32:10,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1049 transitions. [2023-08-30 02:32:10,120 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-30 02:32:10,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 448.0) internal successors, (2688), 6 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:32:10,122 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 448.0) internal successors, (2688), 6 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:32:10,122 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 157 flow. Second operand 5 states and 1049 transitions. [2023-08-30 02:32:10,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 120 transitions, 520 flow [2023-08-30 02:32:10,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 120 transitions, 512 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:32:10,138 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 154 flow [2023-08-30 02:32:10,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, 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-30 02:32:10,138 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2023-08-30 02:32:10,138 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 154 flow [2023-08-30 02:32:10,138 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-30 02:32:10,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:32:10,138 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:32:10,143 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-30 02:32:10,339 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,SelfDestructingSolverStorable38 [2023-08-30 02:32:10,339 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2023-08-30 02:32:10,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:32:10,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1222026298, now seen corresponding path program 1 times [2023-08-30 02:32:10,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:32:10,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747437927] [2023-08-30 02:32:10,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:32:10,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:32:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:32:10,427 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-30 02:32:10,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:32:10,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747437927] [2023-08-30 02:32:10,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747437927] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:32:10,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:32:10,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:32:10,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028308316] [2023-08-30 02:32:10,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:32:10,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:32:10,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:32:10,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:32:10,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:32:10,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 448 [2023-08-30 02:32:10,475 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-30 02:32:10,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:32:10,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 448 [2023-08-30 02:32:10,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:32:12,341 INFO L130 PetriNetUnfolder]: 20823/30823 cut-off events. [2023-08-30 02:32:12,341 INFO L131 PetriNetUnfolder]: For 12226/12226 co-relation queries the response was YES. [2023-08-30 02:32:12,445 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 1421. Compared 217848 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-30 02:32:12,599 INFO L137 encePairwiseOnDemand]: 443/448 looper letters, 51 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2023-08-30 02:32:12,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 77 transitions, 341 flow [2023-08-30 02:32:12,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:32:12,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:32:12,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 808 transitions. [2023-08-30 02:32:12,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45089285714285715 [2023-08-30 02:32:12,601 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 808 transitions. [2023-08-30 02:32:12,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 808 transitions. [2023-08-30 02:32:12,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:32:12,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 808 transitions. [2023-08-30 02:32:12,602 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-30 02:32:12,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 448.0) internal successors, (2240), 5 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:32:12,603 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 448.0) internal successors, (2240), 5 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:32:12,603 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 154 flow. Second operand 4 states and 808 transitions. [2023-08-30 02:32:12,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 77 transitions, 341 flow [2023-08-30 02:32:12,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 77 transitions, 319 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-30 02:32:12,607 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 159 flow [2023-08-30 02:32:12,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, 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-30 02:32:12,607 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2023-08-30 02:32:12,608 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 159 flow [2023-08-30 02:32:12,608 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-30 02:32:12,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:32:12,608 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:32:12,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-08-30 02:32:12,608 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2023-08-30 02:32:12,608 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:32:12,609 INFO L85 PathProgramCache]: Analyzing trace with hash 771896183, now seen corresponding path program 1 times [2023-08-30 02:32:12,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:32:12,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85070605] [2023-08-30 02:32:12,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:32:12,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:32:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:32:12,755 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-30 02:32:12,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:32:12,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85070605] [2023-08-30 02:32:12,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85070605] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:32:12,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492525858] [2023-08-30 02:32:12,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:32:12,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:32:12,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:32:12,765 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-30 02:32:12,768 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-30 02:32:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:32:12,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-30 02:32:12,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:32:12,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:32:12,860 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-30 02:32:12,970 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-30 02:32:12,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:32:13,046 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-30 02:32:13,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492525858] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:32:13,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:32:13,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2023-08-30 02:32:13,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154383698] [2023-08-30 02:32:13,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:32:13,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 02:32:13,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:32:13,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 02:32:13,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-08-30 02:32:13,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 448 [2023-08-30 02:32:13,465 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-30 02:32:13,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:32:13,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 448 [2023-08-30 02:32:13,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:32:16,146 INFO L130 PetriNetUnfolder]: 23705/35839 cut-off events. [2023-08-30 02:32:16,146 INFO L131 PetriNetUnfolder]: For 9659/9659 co-relation queries the response was YES. [2023-08-30 02:32:16,319 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 1678. Compared 270257 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-30 02:32:16,486 INFO L137 encePairwiseOnDemand]: 444/448 looper letters, 76 selfloop transitions, 4 changer transitions 0/103 dead transitions. [2023-08-30 02:32:16,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 103 transitions, 463 flow [2023-08-30 02:32:16,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:32:16,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:32:16,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1005 transitions. [2023-08-30 02:32:16,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4486607142857143 [2023-08-30 02:32:16,487 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1005 transitions. [2023-08-30 02:32:16,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1005 transitions. [2023-08-30 02:32:16,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:32:16,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1005 transitions. [2023-08-30 02:32:16,488 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-30 02:32:16,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 448.0) internal successors, (2688), 6 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:32:16,490 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 448.0) internal successors, (2688), 6 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:32:16,490 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 159 flow. Second operand 5 states and 1005 transitions. [2023-08-30 02:32:16,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 103 transitions, 463 flow [2023-08-30 02:32:16,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 103 transitions, 457 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:32:16,501 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 171 flow [2023-08-30 02:32:16,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, 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-30 02:32:16,501 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2023-08-30 02:32:16,501 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 171 flow [2023-08-30 02:32:16,501 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-30 02:32:16,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:32:16,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:32:16,506 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-30 02:32:16,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:32:16,702 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2023-08-30 02:32:16,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:32:16,702 INFO L85 PathProgramCache]: Analyzing trace with hash 985956853, now seen corresponding path program 1 times [2023-08-30 02:32:16,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:32:16,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778898613] [2023-08-30 02:32:16,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:32:16,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:32:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:32:16,719 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-30 02:32:16,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:32:16,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778898613] [2023-08-30 02:32:16,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778898613] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:32:16,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:32:16,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:32:16,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324012219] [2023-08-30 02:32:16,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:32:16,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:32:16,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:32:16,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:32:16,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:32:16,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 448 [2023-08-30 02:32:16,751 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-30 02:32:16,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:32:16,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 448 [2023-08-30 02:32:16,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:32:21,663 INFO L130 PetriNetUnfolder]: 60372/86283 cut-off events. [2023-08-30 02:32:21,664 INFO L131 PetriNetUnfolder]: For 27018/27018 co-relation queries the response was YES. [2023-08-30 02:32:22,039 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 3866. Compared 652227 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-30 02:32:22,435 INFO L137 encePairwiseOnDemand]: 441/448 looper letters, 63 selfloop transitions, 6 changer transitions 0/85 dead transitions. [2023-08-30 02:32:22,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 85 transitions, 404 flow [2023-08-30 02:32:22,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:32:22,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:32:22,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 619 transitions. [2023-08-30 02:32:22,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46056547619047616 [2023-08-30 02:32:22,436 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 619 transitions. [2023-08-30 02:32:22,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 619 transitions. [2023-08-30 02:32:22,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:32:22,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 619 transitions. [2023-08-30 02:32:22,437 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-30 02:32:22,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 448.0) internal successors, (1792), 4 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:32:22,438 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 448.0) internal successors, (1792), 4 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:32:22,438 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 171 flow. Second operand 3 states and 619 transitions. [2023-08-30 02:32:22,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 85 transitions, 404 flow [2023-08-30 02:32:22,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 85 transitions, 394 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:32:22,455 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 207 flow [2023-08-30 02:32:22,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, 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-30 02:32:22,455 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2023-08-30 02:32:22,455 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 207 flow [2023-08-30 02:32:22,455 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-30 02:32:22,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:32:22,456 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:32:22,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-08-30 02:32:22,456 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2023-08-30 02:32:22,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:32:22,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1841016346, now seen corresponding path program 2 times [2023-08-30 02:32:22,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:32:22,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701285500] [2023-08-30 02:32:22,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:32:22,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:32:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:32:22,491 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-30 02:32:22,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:32:22,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701285500] [2023-08-30 02:32:22,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701285500] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:32:22,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765521547] [2023-08-30 02:32:22,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:32:22,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:32:22,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:32:22,494 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-30 02:32:22,496 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-30 02:32:22,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 02:32:22,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:32:22,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 02:32:22,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:32:22,584 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-30 02:32:22,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:32:22,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765521547] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:32:22,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 02:32:22,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-30 02:32:22,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713963172] [2023-08-30 02:32:22,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:32:22,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:32:22,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:32:22,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:32:22,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:32:22,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 448 [2023-08-30 02:32:22,605 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-30 02:32:22,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:32:22,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 448 [2023-08-30 02:32:22,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:32:25,840 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 159#L714-1true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 393#true, Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:25,840 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-30 02:32:25,840 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:25,840 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:25,840 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:26,677 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 159#L714-1true, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 393#true, Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:26,678 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 02:32:26,678 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:26,678 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:26,678 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:26,684 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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], [18#thr1EXITtrue, 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 159#L714-1true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 393#true, Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:26,684 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 02:32:26,684 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:26,684 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:26,685 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:26,763 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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], [18#thr1EXITtrue, 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 210#true, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 159#L714-1true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 393#true, Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:26,763 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:32:26,764 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:26,764 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:26,764 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:26,801 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 159#L714-1true, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 95#L718true, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 393#true, Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:26,801 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:32:26,801 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:26,802 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:26,802 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:26,831 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 159#L714-1true, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 95#L718true, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 393#true, Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:26,831 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:32:26,831 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:26,831 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:26,831 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:26,836 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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], [18#thr1EXITtrue, 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 159#L714-1true, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 393#true, Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:26,836 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:32:26,836 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:26,836 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:26,836 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:26,862 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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], [18#thr1EXITtrue, 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 210#true, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 159#L714-1true, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 393#true, Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:26,862 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:32:26,862 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:32:26,862 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:26,862 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:26,874 INFO L130 PetriNetUnfolder]: 30558/47957 cut-off events. [2023-08-30 02:32:26,874 INFO L131 PetriNetUnfolder]: For 13940/14731 co-relation queries the response was YES. [2023-08-30 02:32:27,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104527 conditions, 47957 events. 30558/47957 cut-off events. For 13940/14731 co-relation queries the response was YES. Maximal size of possible extension queue 2330. Compared 406205 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-30 02:32:27,231 INFO L137 encePairwiseOnDemand]: 444/448 looper letters, 98 selfloop transitions, 4 changer transitions 0/128 dead transitions. [2023-08-30 02:32:27,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 128 transitions, 625 flow [2023-08-30 02:32:27,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:32:27,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:32:27,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1042 transitions. [2023-08-30 02:32:27,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46517857142857144 [2023-08-30 02:32:27,233 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1042 transitions. [2023-08-30 02:32:27,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1042 transitions. [2023-08-30 02:32:27,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:32:27,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1042 transitions. [2023-08-30 02:32:27,234 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-30 02:32:27,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 448.0) internal successors, (2688), 6 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:32:27,235 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 448.0) internal successors, (2688), 6 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:32:27,235 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 207 flow. Second operand 5 states and 1042 transitions. [2023-08-30 02:32:27,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 128 transitions, 625 flow [2023-08-30 02:32:27,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 128 transitions, 605 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:32:27,301 INFO L231 Difference]: Finished difference. Result has 71 places, 59 transitions, 198 flow [2023-08-30 02:32:27,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, 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-30 02:32:27,302 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 9 predicate places. [2023-08-30 02:32:27,302 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 59 transitions, 198 flow [2023-08-30 02:32:27,302 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-30 02:32:27,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:32:27,302 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 02:32:27,309 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-30 02:32:27,502 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,SelfDestructingSolverStorable42 [2023-08-30 02:32:27,503 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2023-08-30 02:32:27,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:32:27,503 INFO L85 PathProgramCache]: Analyzing trace with hash -485807790, now seen corresponding path program 1 times [2023-08-30 02:32:27,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:32:27,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642700326] [2023-08-30 02:32:27,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:32:27,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:32:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:32:27,841 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-30 02:32:27,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:32:27,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642700326] [2023-08-30 02:32:27,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642700326] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:32:27,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:32:27,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:32:27,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926960893] [2023-08-30 02:32:27,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:32:27,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:32:27,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:32:27,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:32:27,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:32:27,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 448 [2023-08-30 02:32:27,916 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-30 02:32:27,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:32:27,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 448 [2023-08-30 02:32:27,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:32:31,199 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 25#L705-6true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,199 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-30 02:32:31,199 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 02:32:31,199 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:32:31,199 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 02:32:31,357 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [37#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,357 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-30 02:32:31,357 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:32:31,357 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:32:31,357 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:31,358 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 182#L712true, 183#thr1EXITtrue, 177#L729-5true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,358 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-30 02:32:31,358 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:32:31,358 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:31,358 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:32:31,358 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 108#thr1EXITtrue, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 25#L705-6true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,358 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-30 02:32:31,358 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:32:31,358 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:32:31,358 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:31,368 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 25#L705-6true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,368 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-30 02:32:31,368 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:32:31,368 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:32:31,368 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:31,378 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:31,378 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-30 02:32:31,378 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:32:31,378 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 02:32:31,378 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:31,475 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [37#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,476 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,476 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:31,476 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,476 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:31,476 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 108#thr1EXITtrue, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 182#L712true, 183#thr1EXITtrue, 177#L729-5true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,476 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,476 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:31,476 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:31,476 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,477 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, 177#L729-5true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,477 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,477 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:31,477 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,477 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:31,485 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [37#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,485 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,485 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:31,485 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:31,485 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,486 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 182#L712true, 183#thr1EXITtrue, 177#L729-5true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:31,486 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,486 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:31,486 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:31,486 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,486 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 108#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 25#L705-6true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:31,486 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,486 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:31,486 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,486 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:31,493 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 108#thr1EXITtrue, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:31,493 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,493 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:31,493 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,493 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:31,494 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:31,494 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,494 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,494 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:31,494 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:31,495 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:31,496 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,496 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:31,496 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,496 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:31,522 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 25#L705-6true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,522 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,522 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,522 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,522 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,559 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:31,559 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,559 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,560 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,560 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,569 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 108#thr1EXITtrue, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, 177#L729-5true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,569 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,569 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,569 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,569 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,570 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 86#thr1EXITtrue, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, 177#L729-5true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,570 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,570 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,570 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,570 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,575 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [37#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, 108#thr1EXITtrue, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,575 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,576 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,576 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,576 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,576 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 182#L712true, 183#thr1EXITtrue, 177#L729-5true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,576 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,576 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,576 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,576 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,577 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 95#L718true, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 116#L718true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,577 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,577 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,577 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,577 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,580 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 108#thr1EXITtrue, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:31,580 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,580 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,580 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,580 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,581 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,582 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,582 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,582 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,582 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,582 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,582 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,582 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,582 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,582 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:31,608 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [37#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,608 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,608 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,608 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,608 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,608 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 182#L712true, 183#thr1EXITtrue, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,608 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,608 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,608 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,608 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,609 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 108#thr1EXITtrue, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 25#L705-6true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,609 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,609 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,609 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,609 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,619 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 25#L705-6true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:31,619 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,619 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,619 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,619 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,629 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 95#L718true, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:31,629 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,629 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,629 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,629 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,637 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,637 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,637 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,637 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,637 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,637 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 86#thr1EXITtrue, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:31,638 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,638 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,638 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,638 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,639 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,639 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,639 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,639 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,639 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,642 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 86#thr1EXITtrue, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 108#thr1EXITtrue, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, 177#L729-5true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,642 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,642 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,643 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,643 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,647 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 108#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 116#L718true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,647 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,647 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,647 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,648 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,648 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 86#thr1EXITtrue, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 95#L718true, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 116#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:31,648 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,648 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,648 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,648 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,654 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,654 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,654 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,654 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,654 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:31,670 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [37#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,670 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,670 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,670 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,670 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,671 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 182#L712true, 183#thr1EXITtrue, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,671 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,671 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,671 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,671 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,671 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 116#L718true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,671 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,671 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,671 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,671 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,842 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [37#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,843 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,843 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,843 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,843 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,843 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 182#L712true, 183#thr1EXITtrue, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:31,844 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,844 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,844 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,844 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,844 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 25#L705-6true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:31,844 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,845 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,845 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,845 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,852 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:31,862 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,862 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,862 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,863 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,863 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 95#L718true, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:31,863 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,864 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,864 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,864 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,866 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,866 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,866 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,866 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,866 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,869 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 86#thr1EXITtrue, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,869 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,869 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,869 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,869 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,870 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 108#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:31,870 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,870 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,870 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,870 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,870 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 86#thr1EXITtrue, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:31,870 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,870 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,870 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,870 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,874 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 86#thr1EXITtrue, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 108#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 116#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,874 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,874 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,874 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,874 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:31,877 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:31,877 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,877 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,877 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,877 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,885 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 116#L718true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,885 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,885 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,885 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,885 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,886 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 86#thr1EXITtrue, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 116#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,886 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,886 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,886 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,886 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,892 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [37#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 108#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,892 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,892 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,892 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,892 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,892 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 182#L712true, 183#thr1EXITtrue, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,892 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,892 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,893 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,893 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,893 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 116#L718true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,893 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,893 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,893 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,893 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,897 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:31,897 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,897 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,897 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,897 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,898 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, 108#thr1EXITtrue, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,898 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,898 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,898 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,898 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,899 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,899 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,899 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,899 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,899 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,900 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 86#thr1EXITtrue, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 108#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:31,900 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,900 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,900 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:31,900 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,903 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:31,903 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:32:31,903 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,903 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,903 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:32:31,903 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 86#thr1EXITtrue, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:31,903 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:32:31,904 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:32:31,904 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,904 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,905 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,905 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:32:31,906 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,906 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:32:31,906 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,908 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 116#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,908 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:32:31,908 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,908 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:32:31,908 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,913 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 108#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 116#L718true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,913 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:32:31,913 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,913 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:32:31,913 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,913 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 86#thr1EXITtrue, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 116#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,914 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:32:31,914 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,914 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:32:31,914 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,916 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 100#L718true, 108#thr1EXITtrue, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:31,916 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:32:31,916 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,916 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:32:31,916 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:31,918 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 86#thr1EXITtrue, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 390#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (< |thr1Thread2of4ForFork0_findMax_~i~0#1| 7) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:31,918 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-30 02:32:31,918 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:32:31,918 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:32:31,918 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:32:31,919 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 108#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:31,919 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-30 02:32:31,919 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:32:31,919 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:32:31,919 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:32:31,919 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 86#thr1EXITtrue, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:31,919 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-30 02:32:31,920 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:32:31,920 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:32:31,920 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:32:31,924 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 86#thr1EXITtrue, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 108#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 116#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:31,924 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-30 02:32:31,924 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:32:31,924 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:32:31,924 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:32:31,925 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 86#thr1EXITtrue, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 108#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:31,925 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-30 02:32:31,925 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-30 02:32:31,926 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:32:31,926 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:32:31,927 INFO L130 PetriNetUnfolder]: 34260/50883 cut-off events. [2023-08-30 02:32:31,928 INFO L131 PetriNetUnfolder]: For 25701/26713 co-relation queries the response was YES. [2023-08-30 02:32:32,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117890 conditions, 50883 events. 34260/50883 cut-off events. For 25701/26713 co-relation queries the response was YES. Maximal size of possible extension queue 2262. Compared 384672 event pairs, 21635 based on Foata normal form. 0/41970 useless extension candidates. Maximal degree in co-relation 117877. Up to 36958 conditions per place. [2023-08-30 02:32:32,254 INFO L137 encePairwiseOnDemand]: 443/448 looper letters, 54 selfloop transitions, 3 changer transitions 0/83 dead transitions. [2023-08-30 02:32:32,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 83 transitions, 404 flow [2023-08-30 02:32:32,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:32:32,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:32:32,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 805 transitions. [2023-08-30 02:32:32,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44921875 [2023-08-30 02:32:32,256 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 805 transitions. [2023-08-30 02:32:32,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 805 transitions. [2023-08-30 02:32:32,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:32:32,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 805 transitions. [2023-08-30 02:32:32,257 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-30 02:32:32,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 448.0) internal successors, (2240), 5 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:32:32,258 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 448.0) internal successors, (2240), 5 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:32:32,258 INFO L175 Difference]: Start difference. First operand has 71 places, 59 transitions, 198 flow. Second operand 4 states and 805 transitions. [2023-08-30 02:32:32,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 83 transitions, 404 flow [2023-08-30 02:32:32,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 83 transitions, 382 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-30 02:32:32,269 INFO L231 Difference]: Finished difference. Result has 72 places, 60 transitions, 203 flow [2023-08-30 02:32:32,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, 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-30 02:32:32,270 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 10 predicate places. [2023-08-30 02:32:32,270 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 60 transitions, 203 flow [2023-08-30 02:32:32,270 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-30 02:32:32,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:32:32,270 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:32:32,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-08-30 02:32:32,270 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2023-08-30 02:32:32,271 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:32:32,271 INFO L85 PathProgramCache]: Analyzing trace with hash 2119833473, now seen corresponding path program 1 times [2023-08-30 02:32:32,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:32:32,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384216313] [2023-08-30 02:32:32,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:32:32,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:32:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:32:32,394 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-30 02:32:32,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:32:32,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384216313] [2023-08-30 02:32:32,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384216313] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:32:32,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313134705] [2023-08-30 02:32:32,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:32:32,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:32:32,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:32:32,397 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-30 02:32:32,399 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-30 02:32:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:32:32,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-30 02:32:32,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:32:32,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:32:32,502 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-30 02:32:32,617 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-30 02:32:32,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:32:32,689 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-30 02:32:32,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313134705] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:32:32,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:32:32,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2023-08-30 02:32:32,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574353458] [2023-08-30 02:32:32,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:32:32,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 02:32:32,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:32:32,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 02:32:32,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-08-30 02:32:33,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 448 [2023-08-30 02:32:33,008 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-30 02:32:33,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:32:33,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 448 [2023-08-30 02:32:33,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:32:37,032 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 159#L714-1true, thr1Thread2of4ForFork0InUse, 95#L718true, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 442#(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)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:37,032 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 02:32:37,032 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:37,032 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:37,032 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:37,054 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [37#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:37,055 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 02:32:37,055 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:37,055 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:37,055 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:37,055 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 182#L712true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:37,055 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 02:32:37,055 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:37,055 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:37,055 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:37,066 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 95#L718true, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:37,066 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 02:32:37,066 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:37,066 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:37,067 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:32:37,144 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 159#L714-1true, thr1Thread2of4ForFork0InUse, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 442#(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)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:37,145 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:32:37,145 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:37,145 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:37,145 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:37,162 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [37#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:37,162 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:32:37,162 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:37,162 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:37,162 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:37,163 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 182#L712true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:37,163 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:32:37,163 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:37,163 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:37,163 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:37,163 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, 177#L729-5true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:37,163 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:32:37,163 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:37,163 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:37,164 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:37,171 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 108#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:37,171 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:32:37,172 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:37,172 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:37,172 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:37,172 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 95#L718true, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:37,172 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:32:37,173 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:37,173 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:32:37,173 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:37,406 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 442#(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)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:37,406 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:32:37,406 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:37,406 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:37,406 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:37,416 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, 177#L729-5true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:37,416 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:32:37,416 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:37,416 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:37,416 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:37,417 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, 177#L729-5true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:37,417 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:32:37,417 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:37,417 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:37,417 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:37,421 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 108#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:37,422 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:32:37,422 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:37,422 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:37,422 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:32:37,424 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 159#L714-1true, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:37,424 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:32:37,424 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:37,424 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:37,425 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:37,451 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [37#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:37,451 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:32:37,451 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:37,451 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:37,451 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:37,452 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 182#L712true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:37,452 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:32:37,452 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:37,452 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:37,452 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:37,465 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:37,465 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:32:37,466 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:37,466 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:37,466 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:37,470 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 108#thr1EXITtrue, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 442#(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)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:37,470 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:32:37,470 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:37,471 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:37,471 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:37,471 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, 86#thr1EXITtrue, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 442#(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)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:37,471 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:32:37,471 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:37,471 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:37,471 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:37,477 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, 86#thr1EXITtrue, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, 177#L729-5true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:37,477 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:32:37,477 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:37,477 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:37,477 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:32:37,480 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 159#L714-1true, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:37,480 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:32:37,480 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:32:37,480 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:37,480 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:37,498 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [37#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 108#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:37,498 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:32:37,498 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:37,499 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:37,499 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:37,499 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 108#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 182#L712true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:37,499 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:32:37,499 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:37,499 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:37,499 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:37,500 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:37,500 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:32:37,500 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:37,500 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:37,500 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:37,507 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 108#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:37,507 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:32:37,507 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:37,507 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:37,507 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:37,508 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:37,508 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:32:37,508 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:37,508 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:37,508 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:37,510 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 86#thr1EXITtrue, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 108#thr1EXITtrue, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 442#(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)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:37,510 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:32:37,510 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:37,510 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:37,510 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:32:37,515 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 442#(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)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:37,515 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:32:37,515 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:32:37,515 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:37,515 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:37,528 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 108#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:37,528 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:32:37,528 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:32:37,528 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:37,529 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:37,529 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:37,529 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:32:37,529 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:32:37,530 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:37,530 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:37,536 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 108#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 76#L714-1true, 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:37,536 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:32:37,536 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:32:37,536 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:37,536 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:32:37,539 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 108#thr1EXITtrue, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 442#(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)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:37,539 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-30 02:32:37,539 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:32:37,539 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:32:37,539 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:32:37,540 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, 86#thr1EXITtrue, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 442#(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)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:37,540 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-30 02:32:37,540 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:32:37,541 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:32:37,541 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:32:37,546 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 100#L718true, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 108#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 116#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24))]) [2023-08-30 02:32:37,546 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-30 02:32:37,546 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:32:37,546 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:32:37,546 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:32:37,548 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1352] 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], [403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 535#(and (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, 86#thr1EXITtrue, 100#L718true, thr1Thread1of4ForFork0InUse, Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 108#thr1EXITtrue, 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of4ForFork0InUse, 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 442#(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)), 439#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:32:37,548 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-30 02:32:37,549 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:32:37,549 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:32:37,549 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-30 02:32:37,552 INFO L130 PetriNetUnfolder]: 38159/57644 cut-off events. [2023-08-30 02:32:37,552 INFO L131 PetriNetUnfolder]: For 22771/23672 co-relation queries the response was YES. [2023-08-30 02:32:37,750 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 457553 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-30 02:32:38,014 INFO L137 encePairwiseOnDemand]: 444/448 looper letters, 80 selfloop transitions, 4 changer transitions 0/110 dead transitions. [2023-08-30 02:32:38,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 110 transitions, 541 flow [2023-08-30 02:32:38,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:32:38,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:32:38,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1000 transitions. [2023-08-30 02:32:38,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2023-08-30 02:32:38,016 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1000 transitions. [2023-08-30 02:32:38,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1000 transitions. [2023-08-30 02:32:38,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:32:38,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1000 transitions. [2023-08-30 02:32:38,018 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-30 02:32:38,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 448.0) internal successors, (2688), 6 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:32:38,019 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 448.0) internal successors, (2688), 6 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:32:38,019 INFO L175 Difference]: Start difference. First operand has 72 places, 60 transitions, 203 flow. Second operand 5 states and 1000 transitions. [2023-08-30 02:32:38,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 110 transitions, 541 flow [2023-08-30 02:32:38,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 110 transitions, 535 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:32:38,050 INFO L231 Difference]: Finished difference. Result has 75 places, 61 transitions, 215 flow [2023-08-30 02:32:38,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, 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-30 02:32:38,051 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 13 predicate places. [2023-08-30 02:32:38,051 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 61 transitions, 215 flow [2023-08-30 02:32:38,051 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-30 02:32:38,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:32:38,052 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:32:38,056 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-30 02:32:38,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:32:38,256 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2023-08-30 02:32:38,257 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:32:38,257 INFO L85 PathProgramCache]: Analyzing trace with hash 902900563, now seen corresponding path program 1 times [2023-08-30 02:32:38,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:32:38,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572806825] [2023-08-30 02:32:38,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:32:38,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:32:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:32:38,282 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-30 02:32:38,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:32:38,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572806825] [2023-08-30 02:32:38,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572806825] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:32:38,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:32:38,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:32:38,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915801449] [2023-08-30 02:32:38,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:32:38,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:32:38,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:32:38,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:32:38,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:32:38,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 448 [2023-08-30 02:32:38,316 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-30 02:32:38,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:32:38,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 448 [2023-08-30 02:32:38,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:32:48,435 INFO L130 PetriNetUnfolder]: 88896/127726 cut-off events. [2023-08-30 02:32:48,435 INFO L131 PetriNetUnfolder]: For 65538/66932 co-relation queries the response was YES. [2023-08-30 02:32:48,883 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 1017631 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-30 02:32:49,638 INFO L137 encePairwiseOnDemand]: 441/448 looper letters, 68 selfloop transitions, 9 changer transitions 0/93 dead transitions. [2023-08-30 02:32:49,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 93 transitions, 491 flow [2023-08-30 02:32:49,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:32:49,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:32:49,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 616 transitions. [2023-08-30 02:32:49,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2023-08-30 02:32:49,639 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 616 transitions. [2023-08-30 02:32:49,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 616 transitions. [2023-08-30 02:32:49,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:32:49,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 616 transitions. [2023-08-30 02:32:49,640 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-30 02:32:49,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 448.0) internal successors, (1792), 4 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:32:49,641 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 448.0) internal successors, (1792), 4 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:32:49,641 INFO L175 Difference]: Start difference. First operand has 75 places, 61 transitions, 215 flow. Second operand 3 states and 616 transitions. [2023-08-30 02:32:49,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 93 transitions, 491 flow [2023-08-30 02:32:49,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 93 transitions, 481 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:32:49,712 INFO L231 Difference]: Finished difference. Result has 76 places, 67 transitions, 281 flow [2023-08-30 02:32:49,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, 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-30 02:32:49,713 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 14 predicate places. [2023-08-30 02:32:49,713 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 67 transitions, 281 flow [2023-08-30 02:32:49,713 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-30 02:32:49,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:32:49,713 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 02:32:49,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-08-30 02:32:49,713 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2023-08-30 02:32:49,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:32:49,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1290334002, now seen corresponding path program 2 times [2023-08-30 02:32:49,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:32:49,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960402065] [2023-08-30 02:32:49,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:32:49,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:32:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:32:49,748 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-30 02:32:49,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:32:49,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960402065] [2023-08-30 02:32:49,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960402065] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:32:49,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551670010] [2023-08-30 02:32:49,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:32:49,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:32:49,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:32:49,753 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-30 02:32:49,757 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-30 02:32:49,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 02:32:49,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:32:49,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 02:32:49,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:32:49,855 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-30 02:32:49,855 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:32:49,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551670010] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:32:49,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 02:32:49,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-30 02:32:49,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432349243] [2023-08-30 02:32:49,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:32:49,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:32:49,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:32:49,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:32:49,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:32:49,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 448 [2023-08-30 02:32:49,873 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-30 02:32:49,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:32:49,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 448 [2023-08-30 02:32:49,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:32:56,033 INFO L130 PetriNetUnfolder]: 46770/74901 cut-off events. [2023-08-30 02:32:56,033 INFO L131 PetriNetUnfolder]: For 36021/40284 co-relation queries the response was YES. [2023-08-30 02:32:56,305 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 680757 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-30 02:32:56,641 INFO L137 encePairwiseOnDemand]: 444/448 looper letters, 103 selfloop transitions, 4 changer transitions 0/138 dead transitions. [2023-08-30 02:32:56,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 138 transitions, 748 flow [2023-08-30 02:32:56,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:32:56,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:32:56,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1035 transitions. [2023-08-30 02:32:56,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46205357142857145 [2023-08-30 02:32:56,643 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1035 transitions. [2023-08-30 02:32:56,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1035 transitions. [2023-08-30 02:32:56,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:32:56,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1035 transitions. [2023-08-30 02:32:56,645 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-30 02:32:56,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 448.0) internal successors, (2688), 6 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:32:56,646 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 448.0) internal successors, (2688), 6 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:32:56,646 INFO L175 Difference]: Start difference. First operand has 76 places, 67 transitions, 281 flow. Second operand 5 states and 1035 transitions. [2023-08-30 02:32:56,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 138 transitions, 748 flow [2023-08-30 02:32:56,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 138 transitions, 722 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:32:56,818 INFO L231 Difference]: Finished difference. Result has 77 places, 66 transitions, 266 flow [2023-08-30 02:32:56,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, 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-30 02:32:56,818 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 15 predicate places. [2023-08-30 02:32:56,819 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 66 transitions, 266 flow [2023-08-30 02:32:56,819 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-30 02:32:56,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:32:56,819 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:32:56,825 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-30 02:32:57,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:32:57,024 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2023-08-30 02:32:57,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:32:57,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1993932677, now seen corresponding path program 1 times [2023-08-30 02:32:57,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:32:57,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287887235] [2023-08-30 02:32:57,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:32:57,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:32:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:32:57,134 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-30 02:32:57,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:32:57,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287887235] [2023-08-30 02:32:57,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287887235] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:32:57,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:32:57,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:32:57,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473395402] [2023-08-30 02:32:57,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:32:57,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:32:57,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:32:57,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:32:57,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:32:57,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 448 [2023-08-30 02:32:57,211 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-30 02:32:57,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:32:57,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 448 [2023-08-30 02:32:57,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:33:04,349 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L714-1true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:04,349 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-30 02:33:04,349 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:33:04,349 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:04,349 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:04,447 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:04,448 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-30 02:33:04,448 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:04,448 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:04,448 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:33:05,130 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L714-1true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:05,130 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 02:33:05,130 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:05,130 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:05,130 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:05,209 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:05,209 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 02:33:05,209 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:05,209 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:05,209 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:05,210 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:05,210 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 02:33:05,210 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:05,211 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:05,211 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:05,219 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 603#(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)), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:05,219 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 02:33:05,219 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:05,219 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:05,220 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:33:05,220 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:33:05,859 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 116#L718true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:05,859 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:33:05,859 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:05,859 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:05,859 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:05,877 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L714-1true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:05,877 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:33:05,877 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:05,877 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:05,877 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:05,877 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L714-1true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:05,877 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:33:05,877 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:05,877 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:05,877 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:05,891 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:05,892 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:33:05,892 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:05,892 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:05,892 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:05,895 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:05,895 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:33:05,895 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:05,895 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:05,895 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:05,899 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 603#(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)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:05,899 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:33:05,899 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:05,899 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:05,899 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:05,903 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 603#(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)), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:05,903 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:33:05,903 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:05,903 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:05,903 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:05,904 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:05,992 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L714-1true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:05,993 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:33:05,993 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:05,993 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:05,993 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,099 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:06,099 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:33:06,099 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,099 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:06,099 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,213 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:06,213 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:33:06,213 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:06,213 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:06,213 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:06,230 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 116#L718true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:06,230 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:33:06,230 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:06,230 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:06,231 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:06,236 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 116#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:06,236 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:33:06,236 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:06,236 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:06,236 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:06,248 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L714-1true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:06,248 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,248 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:06,248 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:06,248 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,248 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L714-1true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:06,248 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:33:06,248 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:06,248 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:06,248 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:06,257 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:06,257 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:33:06,257 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,257 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:06,257 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,261 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 603#(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)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:06,261 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:33:06,261 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:06,261 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:06,261 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:06,337 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L714-1true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:06,337 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,337 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:06,337 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:06,337 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,413 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:06,413 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:33:06,414 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,414 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,414 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:06,414 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:06,415 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,415 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:06,415 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,415 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:06,417 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:06,417 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:33:06,417 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:06,417 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:06,417 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:06,424 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 603#(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)), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:06,424 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,424 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:06,424 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,424 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:06,424 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,478 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:06,479 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,479 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,479 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:06,479 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:06,482 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 603#(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)), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:06,482 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,482 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:06,482 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,482 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:06,493 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 116#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:06,493 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,493 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,493 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:06,493 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:06,846 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 116#L718true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:06,846 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:33:06,846 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,846 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:06,846 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,862 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L714-1true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:06,863 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:33:06,863 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:06,863 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:06,863 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:06,863 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L714-1true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:06,863 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:33:06,863 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:06,863 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,863 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,876 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:06,876 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:33:06,876 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:06,876 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:06,876 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:06,882 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 603#(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)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:06,882 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:33:06,882 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,882 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:06,882 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,885 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:06,885 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:33:06,885 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:06,885 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,885 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,885 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:06,917 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 183#thr1EXITtrue, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:06,917 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:33:06,917 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,917 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:06,917 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:06,972 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 603#(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)), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:06,972 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:33:06,972 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:06,972 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:06,972 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:06,990 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 116#L718true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:06,990 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:33:06,990 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:06,990 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:06,990 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:06,996 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 116#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:06,996 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:33:06,996 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:06,997 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:06,997 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:07,009 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L714-1true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:07,009 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:33:07,009 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:07,009 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:07,009 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:07,009 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L714-1true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:07,010 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-30 02:33:07,010 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:07,010 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:33:07,010 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:07,020 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:07,021 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:33:07,021 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:33:07,021 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:07,021 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:33:07,026 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 603#(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)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:07,026 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:33:07,026 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:07,026 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:07,026 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:07,074 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 603#(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)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:07,074 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-30 02:33:07,074 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:07,074 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:33:07,074 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:07,077 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 539#(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|)))), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:07,077 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-30 02:33:07,077 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:07,077 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:07,077 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:33:07,089 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 116#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:07,089 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-30 02:33:07,089 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:07,089 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:07,089 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:33:07,128 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:07,128 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-30 02:33:07,128 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:33:07,128 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:33:07,128 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-30 02:33:07,162 INFO L130 PetriNetUnfolder]: 77510/122126 cut-off events. [2023-08-30 02:33:07,162 INFO L131 PetriNetUnfolder]: For 73988/81248 co-relation queries the response was YES. [2023-08-30 02:33:07,652 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 6287. Compared 1136522 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-30 02:33:08,203 INFO L137 encePairwiseOnDemand]: 444/448 looper letters, 60 selfloop transitions, 3 changer transitions 0/94 dead transitions. [2023-08-30 02:33:08,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 94 transitions, 503 flow [2023-08-30 02:33:08,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:33:08,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:33:08,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 804 transitions. [2023-08-30 02:33:08,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4486607142857143 [2023-08-30 02:33:08,205 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 804 transitions. [2023-08-30 02:33:08,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 804 transitions. [2023-08-30 02:33:08,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:33:08,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 804 transitions. [2023-08-30 02:33:08,206 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-30 02:33:08,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 448.0) internal successors, (2240), 5 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:33:08,208 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 448.0) internal successors, (2240), 5 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:33:08,208 INFO L175 Difference]: Start difference. First operand has 77 places, 66 transitions, 266 flow. Second operand 4 states and 804 transitions. [2023-08-30 02:33:08,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 94 transitions, 503 flow [2023-08-30 02:33:08,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 94 transitions, 481 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-30 02:33:08,287 INFO L231 Difference]: Finished difference. Result has 78 places, 67 transitions, 269 flow [2023-08-30 02:33:08,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, 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-30 02:33:08,287 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 16 predicate places. [2023-08-30 02:33:08,288 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 67 transitions, 269 flow [2023-08-30 02:33:08,288 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-30 02:33:08,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:33:08,288 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:33:08,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2023-08-30 02:33:08,288 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2023-08-30 02:33:08,288 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:33:08,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1682364117, now seen corresponding path program 1 times [2023-08-30 02:33:08,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:33:08,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238151575] [2023-08-30 02:33:08,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:33:08,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:33:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:33:08,428 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-30 02:33:08,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:33:08,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238151575] [2023-08-30 02:33:08,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238151575] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:33:08,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753852852] [2023-08-30 02:33:08,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:33:08,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:33:08,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:33:08,430 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-30 02:33:08,433 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-30 02:33:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:33:08,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-30 02:33:08,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:33:08,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:33:08,531 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-30 02:33:08,887 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-30 02:33:08,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:33:08,998 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-30 02:33:08,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753852852] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:33:08,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:33:08,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2023-08-30 02:33:08,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844377319] [2023-08-30 02:33:08,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:33:08,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 02:33:08,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:33:08,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 02:33:09,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-08-30 02:33:09,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 448 [2023-08-30 02:33:09,371 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-30 02:33:09,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:33:09,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 448 [2023-08-30 02:33:09,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:33:16,138 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][91], [722#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 603#(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)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L714-1true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:16,138 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-30 02:33:16,138 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:16,138 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:16,138 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:33:16,474 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][91], [18#thr1EXITtrue, 722#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 603#(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)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:16,475 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-30 02:33:16,475 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:16,475 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:33:16,475 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:16,902 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][91], [722#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 603#(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)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L714-1true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:16,909 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 02:33:16,909 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:16,909 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:16,909 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:16,910 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][108], [210#true, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 603#(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: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L714-1true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), 724#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:16,910 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 02:33:16,910 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:16,910 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:16,911 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:16,983 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][91], [18#thr1EXITtrue, 722#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 603#(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)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:16,983 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 02:33:16,983 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:16,983 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:16,983 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:16,984 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][108], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 603#(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: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), 724#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:16,984 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 02:33:16,984 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:16,984 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:16,984 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:17,003 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1214] 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][91], [18#thr1EXITtrue, 722#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:17,004 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 02:33:17,004 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:17,004 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:33:17,004 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 02:33:17,004 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:17,618 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][108], [210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 603#(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: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L714-1true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), 724#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:17,618 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:33:17,618 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:17,618 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:17,618 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:17,618 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 720#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 603#(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: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L714-1true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:17,618 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:33:17,619 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:17,619 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:17,619 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:17,641 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][91], [18#thr1EXITtrue, 722#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 116#L718true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:17,642 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:33:17,642 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:17,642 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:17,642 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:17,670 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][108], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 603#(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: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), 724#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:17,671 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:33:17,671 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:17,671 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:17,671 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:17,671 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 720#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 603#(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: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:17,671 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:33:17,671 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:17,671 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:17,671 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:17,676 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1214] 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][91], [18#thr1EXITtrue, 722#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:17,676 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:33:17,676 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:17,676 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:17,676 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:17,677 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:17,677 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1214] 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][108], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 603#(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: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), 724#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:17,677 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-30 02:33:17,677 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:17,677 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:17,677 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:17,677 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 02:33:17,748 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][91], [722#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L714-1true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:17,748 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:33:17,748 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:17,748 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:17,748 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:17,832 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][91], [18#thr1EXITtrue, 722#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 603#(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)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:17,832 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:33:17,832 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:17,833 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:17,833 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:17,917 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][91], [18#thr1EXITtrue, 722#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 603#(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)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:17,917 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:33:17,917 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:17,917 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:17,917 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:17,922 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 720#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 603#(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: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L714-1true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:17,922 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:33:17,922 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:17,922 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:17,923 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:17,936 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][91], [18#thr1EXITtrue, 722#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 116#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:17,936 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:33:17,936 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:17,936 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:17,936 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:17,938 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][108], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 603#(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: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 116#L718true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), 724#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:17,938 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:33:17,938 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:17,938 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:17,938 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:17,956 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 720#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 603#(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: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:17,956 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:33:17,956 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:17,956 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:17,956 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:17,959 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1214] 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][108], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 603#(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: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), 724#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:17,959 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-30 02:33:17,959 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:17,959 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:17,959 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-30 02:33:17,960 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:18,020 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][91], [722#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L714-1true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:18,020 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:33:18,020 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:18,021 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,021 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,022 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][108], [210#true, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 603#(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: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L714-1true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), 724#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:18,022 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:33:18,022 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,022 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,022 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:18,088 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][91], [18#thr1EXITtrue, 722#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 603#(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)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:18,088 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:33:18,088 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:18,088 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,088 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,090 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][108], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 603#(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: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), 724#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:18,090 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:33:18,090 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,090 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:18,090 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,097 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1214] 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][91], [18#thr1EXITtrue, 722#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:18,098 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:33:18,098 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:18,098 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:18,098 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:18,098 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:18,144 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][91], [18#thr1EXITtrue, 722#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 603#(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)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:18,144 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:33:18,144 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:18,144 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:18,144 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:18,145 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][108], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 603#(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: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), 724#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:18,145 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:33:18,145 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:18,145 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:18,145 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:18,156 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][108], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 177#L729-5true, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 603#(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: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 116#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), 724#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:18,156 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-30 02:33:18,156 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:18,157 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:18,157 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-30 02:33:18,217 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 720#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 603#(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: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L714-1true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:18,217 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:33:18,217 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,217 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:18,217 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,218 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][108], [86#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 603#(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: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L714-1true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), 724#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:18,218 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,218 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:18,218 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:18,218 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,239 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][91], [18#thr1EXITtrue, 722#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 603#(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)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 116#L718true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:18,239 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,239 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:18,239 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:18,239 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,256 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 720#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 603#(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: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 17#L714-1true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:18,256 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-30 02:33:18,256 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:18,256 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:18,256 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:33:18,265 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 720#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 603#(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: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:18,265 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:33:18,265 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,265 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,265 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:18,267 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][108], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 603#(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: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), 724#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:18,267 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,267 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,268 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:18,268 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:18,269 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 720#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 603#(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: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:18,269 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:33:18,269 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:18,269 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:33:18,269 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:33:18,273 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1214] 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][91], [18#thr1EXITtrue, 722#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:18,273 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,273 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:18,273 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,273 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,273 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:18,274 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1214] 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][108], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 603#(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: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), 724#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:18,274 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,274 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,274 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:18,274 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:18,274 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,300 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][108], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 177#L729-5true, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 603#(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: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), 724#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:18,300 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,300 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:18,300 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-30 02:33:18,300 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,342 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][91], [18#thr1EXITtrue, 722#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:18,342 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:33:18,342 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,342 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:18,342 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,604 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][91], [18#thr1EXITtrue, 722#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 603#(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)), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 116#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:18,604 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:33:18,604 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:18,605 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,605 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,607 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][108], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 603#(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: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 116#L718true, 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), 724#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:18,607 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:33:18,607 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:18,607 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,608 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,634 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1214] 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][108], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 603#(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: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 76#L714-1true, Black: 442#(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)), 724#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:18,635 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-30 02:33:18,635 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,635 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:18,635 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-30 02:33:18,635 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:18,681 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][91], [18#thr1EXITtrue, 722#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, 603#(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: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:18,681 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-30 02:33:18,681 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:33:18,681 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:18,681 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:18,682 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][108], [18#thr1EXITtrue, 210#true, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 603#(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: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 4#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), 724#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:18,682 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-30 02:33:18,682 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:33:18,682 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:18,682 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:18,693 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][108], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 95#L718true, thr1Thread3of4ForFork0InUse, 167#L729-4true, thr1Thread4of4ForFork0InUse, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 603#(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: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 116#L718true, Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), 724#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:18,693 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-30 02:33:18,693 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:18,693 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:33:18,693 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-30 02:33:18,724 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1214] 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][108], [18#thr1EXITtrue, 210#true, 86#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 290#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), thr1Thread2of4ForFork0InUse, 95#L718true, Black: 395#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 167#L729-4true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 183#thr1EXITtrue, Black: 551#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 226#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), Black: 603#(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: 544#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 403#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 233#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 600#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 215#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 219#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 402#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 289#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 552#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 442#(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)), 724#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 317#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|))]) [2023-08-30 02:33:18,724 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-30 02:33:18,724 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:33:18,724 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-30 02:33:18,724 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-30 02:33:18,752 INFO L130 PetriNetUnfolder]: 72713/114164 cut-off events. [2023-08-30 02:33:18,752 INFO L131 PetriNetUnfolder]: For 56694/63207 co-relation queries the response was YES. [2023-08-30 02:33:19,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278137 conditions, 114164 events. 72713/114164 cut-off events. For 56694/63207 co-relation queries the response was YES. Maximal size of possible extension queue 5862. Compared 1045363 event pairs, 20447 based on Foata normal form. 236/104962 useless extension candidates. Maximal degree in co-relation 278120. Up to 34041 conditions per place. [2023-08-30 02:33:19,671 INFO L137 encePairwiseOnDemand]: 444/448 looper letters, 110 selfloop transitions, 5 changer transitions 0/146 dead transitions. [2023-08-30 02:33:19,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 146 transitions, 791 flow [2023-08-30 02:33:19,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:33:19,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:33:19,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1212 transitions. [2023-08-30 02:33:19,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45089285714285715 [2023-08-30 02:33:19,673 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1212 transitions. [2023-08-30 02:33:19,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1212 transitions. [2023-08-30 02:33:19,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:33:19,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1212 transitions. [2023-08-30 02:33:19,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:33:19,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 448.0) internal successors, (3136), 7 states have internal predecessors, (3136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:33:19,678 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 448.0) internal successors, (3136), 7 states have internal predecessors, (3136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:33:19,679 INFO L175 Difference]: Start difference. First operand has 78 places, 67 transitions, 269 flow. Second operand 6 states and 1212 transitions. [2023-08-30 02:33:19,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 146 transitions, 791 flow [2023-08-30 02:33:19,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 146 transitions, 787 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:33:19,922 INFO L231 Difference]: Finished difference. Result has 82 places, 68 transitions, 283 flow [2023-08-30 02:33:19,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, 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=6, PETRI_FLOW=283, PETRI_PLACES=82, PETRI_TRANSITIONS=68} [2023-08-30 02:33:19,922 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 20 predicate places. [2023-08-30 02:33:19,922 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 68 transitions, 283 flow [2023-08-30 02:33:19,923 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-30 02:33:19,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:33:19,923 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:33:19,929 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-30 02:33:20,124 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,SelfDestructingSolverStorable48 [2023-08-30 02:33:20,124 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2023-08-30 02:33:20,124 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:33:20,124 INFO L85 PathProgramCache]: Analyzing trace with hash 273933285, now seen corresponding path program 1 times [2023-08-30 02:33:20,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:33:20,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784639745] [2023-08-30 02:33:20,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:33:20,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:33:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:33:20,143 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-30 02:33:20,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:33:20,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784639745] [2023-08-30 02:33:20,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784639745] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:33:20,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:33:20,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:33:20,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64351723] [2023-08-30 02:33:20,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:33:20,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:33:20,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:33:20,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:33:20,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:33:20,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 448 [2023-08-30 02:33:20,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 68 transitions, 283 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-30 02:33:20,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:33:20,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 448 [2023-08-30 02:33:20,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:33:39,991 INFO L130 PetriNetUnfolder]: 157859/231624 cut-off events. [2023-08-30 02:33:39,991 INFO L131 PetriNetUnfolder]: For 161502/166517 co-relation queries the response was YES. [2023-08-30 02:33:40,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601411 conditions, 231624 events. 157859/231624 cut-off events. For 161502/166517 co-relation queries the response was YES. Maximal size of possible extension queue 11122. Compared 2039704 event pairs, 78802 based on Foata normal form. 0/219313 useless extension candidates. Maximal degree in co-relation 601393. Up to 142521 conditions per place. [2023-08-30 02:33:41,992 INFO L137 encePairwiseOnDemand]: 441/448 looper letters, 74 selfloop transitions, 14 changer transitions 0/104 dead transitions. [2023-08-30 02:33:41,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 104 transitions, 622 flow [2023-08-30 02:33:41,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:33:41,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:33:41,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 613 transitions. [2023-08-30 02:33:41,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45610119047619047 [2023-08-30 02:33:41,994 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 613 transitions. [2023-08-30 02:33:41,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 613 transitions. [2023-08-30 02:33:41,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:33:41,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 613 transitions. [2023-08-30 02:33:41,995 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-30 02:33:41,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 448.0) internal successors, (1792), 4 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:33:41,996 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 448.0) internal successors, (1792), 4 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:33:41,996 INFO L175 Difference]: Start difference. First operand has 82 places, 68 transitions, 283 flow. Second operand 3 states and 613 transitions. [2023-08-30 02:33:41,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 104 transitions, 622 flow [2023-08-30 02:33:43,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 104 transitions, 613 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 02:33:43,021 INFO L231 Difference]: Finished difference. Result has 84 places, 77 transitions, 404 flow [2023-08-30 02:33:43,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=404, PETRI_PLACES=84, PETRI_TRANSITIONS=77} [2023-08-30 02:33:43,021 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 22 predicate places. [2023-08-30 02:33:43,021 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 77 transitions, 404 flow [2023-08-30 02:33:43,021 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-30 02:33:43,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:33:43,021 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1] [2023-08-30 02:33:43,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2023-08-30 02:33:43,022 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2023-08-30 02:33:43,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:33:43,022 INFO L85 PathProgramCache]: Analyzing trace with hash -627828657, now seen corresponding path program 1 times [2023-08-30 02:33:43,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:33:43,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688310092] [2023-08-30 02:33:43,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:33:43,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:33:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:33:43,029 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:33:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:33:43,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:33:43,037 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:33:43,037 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining) [2023-08-30 02:33:43,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 19 remaining) [2023-08-30 02:33:43,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 19 remaining) [2023-08-30 02:33:43,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (15 of 19 remaining) [2023-08-30 02:33:43,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 19 remaining) [2023-08-30 02:33:43,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 19 remaining) [2023-08-30 02:33:43,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (12 of 19 remaining) [2023-08-30 02:33:43,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 19 remaining) [2023-08-30 02:33:43,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 19 remaining) [2023-08-30 02:33:43,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (9 of 19 remaining) [2023-08-30 02:33:43,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 19 remaining) [2023-08-30 02:33:43,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 19 remaining) [2023-08-30 02:33:43,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (6 of 19 remaining) [2023-08-30 02:33:43,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 19 remaining) [2023-08-30 02:33:43,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 19 remaining) [2023-08-30 02:33:43,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (3 of 19 remaining) [2023-08-30 02:33:43,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 19 remaining) [2023-08-30 02:33:43,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 19 remaining) [2023-08-30 02:33:43,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (0 of 19 remaining) [2023-08-30 02:33:43,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2023-08-30 02:33:43,040 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:33:43,041 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-30 02:33:43,041 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-08-30 02:33:43,226 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:33:43,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 249 places, 274 transitions, 593 flow [2023-08-30 02:33:43,267 INFO L130 PetriNetUnfolder]: 41/357 cut-off events. [2023-08-30 02:33:43,267 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2023-08-30 02:33:43,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 357 events. 41/357 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1223 event pairs, 0 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 306. Up to 12 conditions per place. [2023-08-30 02:33:43,271 INFO L82 GeneralOperation]: Start removeDead. Operand has 249 places, 274 transitions, 593 flow [2023-08-30 02:33:43,274 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 249 places, 274 transitions, 593 flow [2023-08-30 02:33:43,274 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:33:43,274 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 249 places, 274 transitions, 593 flow [2023-08-30 02:33:43,275 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 249 places, 274 transitions, 593 flow [2023-08-30 02:33:43,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 249 places, 274 transitions, 593 flow [2023-08-30 02:33:43,314 INFO L130 PetriNetUnfolder]: 41/357 cut-off events. [2023-08-30 02:33:43,314 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2023-08-30 02:33:43,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 357 events. 41/357 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1223 event pairs, 0 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 306. Up to 12 conditions per place. [2023-08-30 02:33:43,331 INFO L119 LiptonReduction]: Number of co-enabled transitions 51520 [2023-08-30 02:33:47,641 INFO L134 LiptonReduction]: Checked pairs total: 79980 [2023-08-30 02:33:47,641 INFO L136 LiptonReduction]: Total number of compositions: 260 [2023-08-30 02:33:47,643 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:33:47,644 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;@7dd0f6e4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:33:47,644 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-08-30 02:33:47,645 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 02:33:47,645 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:33:47,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:33:47,645 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 02:33:47,645 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 19 more)] === [2023-08-30 02:33:47,645 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:33:47,645 INFO L85 PathProgramCache]: Analyzing trace with hash 70444, now seen corresponding path program 1 times [2023-08-30 02:33:47,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:33:47,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529339062] [2023-08-30 02:33:47,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:33:47,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:33:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:33:47,662 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-30 02:33:47,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:33:47,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529339062] [2023-08-30 02:33:47,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529339062] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:33:47,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:33:47,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:33:47,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681112091] [2023-08-30 02:33:47,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:33:47,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:33:47,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:33:47,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:33:47,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:33:47,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 534 [2023-08-30 02:33:47,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 84 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:33:47,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:33:47,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 534 [2023-08-30 02:33:47,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:34:13,663 INFO L130 PetriNetUnfolder]: 275916/375212 cut-off events. [2023-08-30 02:34:13,663 INFO L131 PetriNetUnfolder]: For 58682/58682 co-relation queries the response was YES. [2023-08-30 02:34:14,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728186 conditions, 375212 events. 275916/375212 cut-off events. For 58682/58682 co-relation queries the response was YES. Maximal size of possible extension queue 16383. Compared 2916866 event pairs, 226896 based on Foata normal form. 40217/262766 useless extension candidates. Maximal degree in co-relation 87218. Up to 326337 conditions per place. [2023-08-30 02:34:16,897 INFO L137 encePairwiseOnDemand]: 520/534 looper letters, 42 selfloop transitions, 1 changer transitions 0/71 dead transitions. [2023-08-30 02:34:16,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 71 transitions, 273 flow [2023-08-30 02:34:16,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:34:16,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:34:16,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 749 transitions. [2023-08-30 02:34:16,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4675405742821473 [2023-08-30 02:34:16,898 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 749 transitions. [2023-08-30 02:34:16,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 749 transitions. [2023-08-30 02:34:16,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:34:16,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 749 transitions. [2023-08-30 02:34:16,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 249.66666666666666) internal successors, (749), 3 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:34:16,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 534.0) internal successors, (2136), 4 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:34:16,900 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 534.0) internal successors, (2136), 4 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:34:16,900 INFO L175 Difference]: Start difference. First operand has 75 places, 84 transitions, 213 flow. Second operand 3 states and 749 transitions. [2023-08-30 02:34:16,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 71 transitions, 273 flow [2023-08-30 02:34:16,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 71 transitions, 253 flow, removed 10 selfloop flow, removed 0 redundant places. [2023-08-30 02:34:16,934 INFO L231 Difference]: Finished difference. Result has 74 places, 71 transitions, 169 flow [2023-08-30 02:34:16,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=74, PETRI_TRANSITIONS=71} [2023-08-30 02:34:16,934 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -1 predicate places. [2023-08-30 02:34:16,934 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 71 transitions, 169 flow [2023-08-30 02:34:16,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:34:16,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:34:16,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 02:34:16,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2023-08-30 02:34:16,935 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 19 more)] === [2023-08-30 02:34:16,935 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:34:16,935 INFO L85 PathProgramCache]: Analyzing trace with hash 70442, now seen corresponding path program 1 times [2023-08-30 02:34:16,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:34:16,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448317507] [2023-08-30 02:34:16,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:34:16,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:34:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:34:16,954 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-30 02:34:16,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:34:16,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448317507] [2023-08-30 02:34:16,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448317507] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:34:16,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:34:16,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:34:16,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926900706] [2023-08-30 02:34:16,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:34:16,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:34:16,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:34:16,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:34:16,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:34:16,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 534 [2023-08-30 02:34:16,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 71 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 233.66666666666666) internal successors, (701), 3 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:34:16,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:34:16,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 534 [2023-08-30 02:34:16,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:34:33,887 INFO L130 PetriNetUnfolder]: 178342/246826 cut-off events. [2023-08-30 02:34:33,887 INFO L131 PetriNetUnfolder]: For 7714/7714 co-relation queries the response was YES. [2023-08-30 02:34:34,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469251 conditions, 246826 events. 178342/246826 cut-off events. For 7714/7714 co-relation queries the response was YES. Maximal size of possible extension queue 10263. Compared 1892567 event pairs, 145662 based on Foata normal form. 0/157189 useless extension candidates. Maximal degree in co-relation 469240. Up to 211956 conditions per place. [2023-08-30 02:34:35,824 INFO L137 encePairwiseOnDemand]: 532/534 looper letters, 41 selfloop transitions, 1 changer transitions 0/70 dead transitions. [2023-08-30 02:34:35,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 70 transitions, 251 flow [2023-08-30 02:34:35,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:34:35,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:34:35,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2023-08-30 02:34:35,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4631710362047441 [2023-08-30 02:34:35,826 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 742 transitions. [2023-08-30 02:34:35,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 742 transitions. [2023-08-30 02:34:35,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:34:35,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 742 transitions. [2023-08-30 02:34:35,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:34:35,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 534.0) internal successors, (2136), 4 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:34:35,828 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 534.0) internal successors, (2136), 4 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:34:35,828 INFO L175 Difference]: Start difference. First operand has 74 places, 71 transitions, 169 flow. Second operand 3 states and 742 transitions. [2023-08-30 02:34:35,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 70 transitions, 251 flow [2023-08-30 02:34:35,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 70 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:34:35,830 INFO L231 Difference]: Finished difference. Result has 74 places, 70 transitions, 168 flow [2023-08-30 02:34:35,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=74, PETRI_TRANSITIONS=70} [2023-08-30 02:34:35,830 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -1 predicate places. [2023-08-30 02:34:35,830 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 70 transitions, 168 flow [2023-08-30 02:34:35,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.66666666666666) internal successors, (701), 3 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:34:35,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:34:35,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:34:35,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2023-08-30 02:34:35,831 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 19 more)] === [2023-08-30 02:34:35,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:34:35,831 INFO L85 PathProgramCache]: Analyzing trace with hash 2100472196, now seen corresponding path program 1 times [2023-08-30 02:34:35,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:34:35,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698039678] [2023-08-30 02:34:35,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:34:35,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:34:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:34:35,896 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-30 02:34:35,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:34:35,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698039678] [2023-08-30 02:34:35,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698039678] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:34:35,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:34:35,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:34:35,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974192203] [2023-08-30 02:34:35,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:34:35,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:34:35,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:34:35,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:34:35,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:34:35,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 534 [2023-08-30 02:34:35,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 70 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 230.25) internal successors, (921), 4 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:34:35,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:34:35,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 534 [2023-08-30 02:34:35,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:35:06,683 INFO L130 PetriNetUnfolder]: 303805/419215 cut-off events. [2023-08-30 02:35:06,684 INFO L131 PetriNetUnfolder]: For 13714/13714 co-relation queries the response was YES. [2023-08-30 02:35:07,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799036 conditions, 419215 events. 303805/419215 cut-off events. For 13714/13714 co-relation queries the response was YES. Maximal size of possible extension queue 18021. Compared 3415220 event pairs, 151402 based on Foata normal form. 0/270275 useless extension candidates. Maximal degree in co-relation 799024. Up to 211956 conditions per place. [2023-08-30 02:35:10,247 INFO L137 encePairwiseOnDemand]: 530/534 looper letters, 77 selfloop transitions, 3 changer transitions 0/108 dead transitions. [2023-08-30 02:35:10,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 108 transitions, 424 flow [2023-08-30 02:35:10,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:35:10,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:35:10,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 997 transitions. [2023-08-30 02:35:10,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46676029962546817 [2023-08-30 02:35:10,249 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 997 transitions. [2023-08-30 02:35:10,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 997 transitions. [2023-08-30 02:35:10,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:35:10,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 997 transitions. [2023-08-30 02:35:10,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 249.25) internal successors, (997), 4 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-30 02:35:10,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 534.0) internal successors, (2670), 5 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-30 02:35:10,253 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 534.0) internal successors, (2670), 5 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-30 02:35:10,253 INFO L175 Difference]: Start difference. First operand has 74 places, 70 transitions, 168 flow. Second operand 4 states and 997 transitions. [2023-08-30 02:35:10,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 108 transitions, 424 flow [2023-08-30 02:35:10,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 108 transitions, 423 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:35:10,283 INFO L231 Difference]: Finished difference. Result has 77 places, 71 transitions, 181 flow [2023-08-30 02:35:10,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=77, PETRI_TRANSITIONS=71} [2023-08-30 02:35:10,284 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 2 predicate places. [2023-08-30 02:35:10,284 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 71 transitions, 181 flow [2023-08-30 02:35:10,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 230.25) internal successors, (921), 4 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:35:10,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:35:10,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:35:10,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2023-08-30 02:35:10,285 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 19 more)] === [2023-08-30 02:35:10,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:35:10,285 INFO L85 PathProgramCache]: Analyzing trace with hash 2100472195, now seen corresponding path program 1 times [2023-08-30 02:35:10,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:35:10,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860076132] [2023-08-30 02:35:10,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:35:10,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:35:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:35:10,325 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-30 02:35:10,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:35:10,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860076132] [2023-08-30 02:35:10,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860076132] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:35:10,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:35:10,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:35:10,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044653642] [2023-08-30 02:35:10,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:35:10,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:35:10,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:35:10,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:35:10,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:35:10,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 534 [2023-08-30 02:35:10,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 71 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 221.25) internal successors, (885), 4 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:35:10,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:35:10,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 534 [2023-08-30 02:35:10,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:35:25,742 INFO L130 PetriNetUnfolder]: 141525/199481 cut-off events. [2023-08-30 02:35:25,742 INFO L131 PetriNetUnfolder]: For 22596/22596 co-relation queries the response was YES. [2023-08-30 02:35:26,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392058 conditions, 199481 events. 141525/199481 cut-off events. For 22596/22596 co-relation queries the response was YES. Maximal size of possible extension queue 7772. Compared 1549485 event pairs, 113531 based on Foata normal form. 0/149196 useless extension candidates. Maximal degree in co-relation 392044. Up to 167443 conditions per place. [2023-08-30 02:35:27,566 INFO L137 encePairwiseOnDemand]: 528/534 looper letters, 37 selfloop transitions, 1 changer transitions 0/66 dead transitions. [2023-08-30 02:35:27,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 66 transitions, 247 flow [2023-08-30 02:35:27,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:35:27,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:35:27,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 702 transitions. [2023-08-30 02:35:27,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43820224719101125 [2023-08-30 02:35:27,568 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 702 transitions. [2023-08-30 02:35:27,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 702 transitions. [2023-08-30 02:35:27,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:35:27,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 702 transitions. [2023-08-30 02:35:27,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:35:27,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 534.0) internal successors, (2136), 4 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:35:27,570 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 534.0) internal successors, (2136), 4 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:35:27,570 INFO L175 Difference]: Start difference. First operand has 77 places, 71 transitions, 181 flow. Second operand 3 states and 702 transitions. [2023-08-30 02:35:27,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 66 transitions, 247 flow [2023-08-30 02:35:27,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 66 transitions, 243 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:35:27,583 INFO L231 Difference]: Finished difference. Result has 72 places, 66 transitions, 169 flow [2023-08-30 02:35:27,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=72, PETRI_TRANSITIONS=66} [2023-08-30 02:35:27,584 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -3 predicate places. [2023-08-30 02:35:27,584 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 66 transitions, 169 flow [2023-08-30 02:35:27,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 221.25) internal successors, (885), 4 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:35:27,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:35:27,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 02:35:27,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2023-08-30 02:35:27,585 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 19 more)] === [2023-08-30 02:35:27,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:35:27,585 INFO L85 PathProgramCache]: Analyzing trace with hash 690135537, now seen corresponding path program 1 times [2023-08-30 02:35:27,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:35:27,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673532125] [2023-08-30 02:35:27,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:35:27,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:35:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:35:27,694 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-30 02:35:27,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:35:27,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673532125] [2023-08-30 02:35:27,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673532125] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:35:27,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176187883] [2023-08-30 02:35:27,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:35:27,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:35:27,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:35:27,700 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-30 02:35:27,701 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-30 02:35:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:35:27,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-30 02:35:27,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:35:27,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:35:27,800 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-30 02:35:27,882 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-30 02:35:27,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:35:27,941 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-30 02:35:27,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176187883] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:35:27,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:35:27,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2023-08-30 02:35:27,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246297087] [2023-08-30 02:35:27,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:35:27,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 02:35:27,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:35:27,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 02:35:27,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-08-30 02:35:28,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 534 [2023-08-30 02:35:28,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 66 transitions, 169 flow. Second operand has 11 states, 11 states have (on average 229.63636363636363) internal successors, (2526), 11 states have internal predecessors, (2526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:35:28,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:35:28,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 534 [2023-08-30 02:35:28,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:35:48,939 INFO L130 PetriNetUnfolder]: 197573/276527 cut-off events. [2023-08-30 02:35:48,939 INFO L131 PetriNetUnfolder]: For 18855/18855 co-relation queries the response was YES. [2023-08-30 02:35:49,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538288 conditions, 276527 events. 197573/276527 cut-off events. For 18855/18855 co-relation queries the response was YES. Maximal size of possible extension queue 11113. Compared 2247961 event pairs, 59115 based on Foata normal form. 0/210268 useless extension candidates. Maximal degree in co-relation 538274. Up to 83723 conditions per place. [2023-08-30 02:35:51,354 INFO L137 encePairwiseOnDemand]: 530/534 looper letters, 127 selfloop transitions, 5 changer transitions 0/160 dead transitions. [2023-08-30 02:35:51,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 160 transitions, 683 flow [2023-08-30 02:35:51,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:35:51,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:35:51,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1501 transitions. [2023-08-30 02:35:51,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4684769038701623 [2023-08-30 02:35:51,357 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1501 transitions. [2023-08-30 02:35:51,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1501 transitions. [2023-08-30 02:35:51,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:35:51,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1501 transitions. [2023-08-30 02:35:51,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 250.16666666666666) internal successors, (1501), 6 states have internal predecessors, (1501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:35:51,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 534.0) internal successors, (3738), 7 states have internal predecessors, (3738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:35:51,362 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 534.0) internal successors, (3738), 7 states have internal predecessors, (3738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:35:51,362 INFO L175 Difference]: Start difference. First operand has 72 places, 66 transitions, 169 flow. Second operand 6 states and 1501 transitions. [2023-08-30 02:35:51,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 160 transitions, 683 flow [2023-08-30 02:35:51,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 160 transitions, 682 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:35:51,398 INFO L231 Difference]: Finished difference. Result has 77 places, 67 transitions, 186 flow [2023-08-30 02:35:51,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=77, PETRI_TRANSITIONS=67} [2023-08-30 02:35:51,399 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 2 predicate places. [2023-08-30 02:35:51,399 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 67 transitions, 186 flow [2023-08-30 02:35:51,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 229.63636363636363) internal successors, (2526), 11 states have internal predecessors, (2526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:35:51,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:35:51,399 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-30 02:35:51,404 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-30 02:35:51,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:35:51,600 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 19 more)] === [2023-08-30 02:35:51,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:35:51,600 INFO L85 PathProgramCache]: Analyzing trace with hash -80627932, now seen corresponding path program 2 times [2023-08-30 02:35:51,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:35:51,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488370074] [2023-08-30 02:35:51,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:35:51,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:35:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:35:51,631 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-30 02:35:51,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:35:51,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488370074] [2023-08-30 02:35:51,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488370074] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:35:51,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809813116] [2023-08-30 02:35:51,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:35:51,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:35:51,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:35:51,633 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-30 02:35:51,634 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-30 02:35:51,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 02:35:51,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:35:51,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 02:35:51,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:35:51,737 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-30 02:35:51,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:35:51,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809813116] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:35:51,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 02:35:51,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-30 02:35:51,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280419369] [2023-08-30 02:35:51,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:35:51,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:35:51,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:35:51,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:35:51,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:35:51,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 534 [2023-08-30 02:35:51,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 67 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 231.4) internal successors, (1157), 5 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:35:51,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:35:51,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 534 [2023-08-30 02:35:51,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:36:11,353 INFO L130 PetriNetUnfolder]: 183981/264419 cut-off events. [2023-08-30 02:36:11,353 INFO L131 PetriNetUnfolder]: For 19355/19355 co-relation queries the response was YES. [2023-08-30 02:36:12,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511051 conditions, 264419 events. 183981/264419 cut-off events. For 19355/19355 co-relation queries the response was YES. Maximal size of possible extension queue 10872. Compared 2298386 event pairs, 8555 based on Foata normal form. 6220/209053 useless extension candidates. Maximal degree in co-relation 511035. Up to 167440 conditions per place. [2023-08-30 02:36:13,646 INFO L137 encePairwiseOnDemand]: 530/534 looper letters, 121 selfloop transitions, 5 changer transitions 0/154 dead transitions. [2023-08-30 02:36:13,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 154 transitions, 664 flow [2023-08-30 02:36:13,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:36:13,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:36:13,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1278 transitions. [2023-08-30 02:36:13,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4786516853932584 [2023-08-30 02:36:13,648 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1278 transitions. [2023-08-30 02:36:13,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1278 transitions. [2023-08-30 02:36:13,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:36:13,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1278 transitions. [2023-08-30 02:36:13,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 255.6) internal successors, (1278), 5 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:36:13,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 534.0) internal successors, (3204), 6 states have internal predecessors, (3204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:36:13,652 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 534.0) internal successors, (3204), 6 states have internal predecessors, (3204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:36:13,653 INFO L175 Difference]: Start difference. First operand has 77 places, 67 transitions, 186 flow. Second operand 5 states and 1278 transitions. [2023-08-30 02:36:13,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 154 transitions, 664 flow [2023-08-30 02:36:15,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 154 transitions, 652 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-08-30 02:36:15,336 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 178 flow [2023-08-30 02:36:15,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2023-08-30 02:36:15,337 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -1 predicate places. [2023-08-30 02:36:15,337 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 178 flow [2023-08-30 02:36:15,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 231.4) internal successors, (1157), 5 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:36:15,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:36:15,337 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:36:15,342 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-30 02:36:15,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:36:15,537 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 19 more)] === [2023-08-30 02:36:15,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:36:15,538 INFO L85 PathProgramCache]: Analyzing trace with hash 847567639, now seen corresponding path program 1 times [2023-08-30 02:36:15,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:36:15,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774678410] [2023-08-30 02:36:15,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:36:15,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:36:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:36:15,614 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-30 02:36:15,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:36:15,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774678410] [2023-08-30 02:36:15,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774678410] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:36:15,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:36:15,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:36:15,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552274750] [2023-08-30 02:36:15,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:36:15,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:36:15,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:36:15,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:36:15,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:36:15,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 534 [2023-08-30 02:36:15,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 230.5) internal successors, (922), 4 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:36:15,686 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:36:15,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 534 [2023-08-30 02:36:15,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:36:37,921 INFO L130 PetriNetUnfolder]: 209867/291845 cut-off events. [2023-08-30 02:36:37,921 INFO L131 PetriNetUnfolder]: For 47111/47111 co-relation queries the response was YES. [2023-08-30 02:36:38,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585317 conditions, 291845 events. 209867/291845 cut-off events. For 47111/47111 co-relation queries the response was YES. Maximal size of possible extension queue 10888. Compared 2308779 event pairs, 148523 based on Foata normal form. 0/224220 useless extension candidates. Maximal degree in co-relation 585304. Up to 214565 conditions per place. [2023-08-30 02:36:40,538 INFO L137 encePairwiseOnDemand]: 529/534 looper letters, 67 selfloop transitions, 3 changer transitions 0/98 dead transitions. [2023-08-30 02:36:40,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 98 transitions, 411 flow [2023-08-30 02:36:40,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:36:40,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:36:40,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 982 transitions. [2023-08-30 02:36:40,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4597378277153558 [2023-08-30 02:36:40,540 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 982 transitions. [2023-08-30 02:36:40,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 982 transitions. [2023-08-30 02:36:40,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:36:40,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 982 transitions. [2023-08-30 02:36:40,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 245.5) internal successors, (982), 4 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:36:40,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 534.0) internal successors, (2670), 5 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-30 02:36:40,543 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 534.0) internal successors, (2670), 5 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-30 02:36:40,543 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 178 flow. Second operand 4 states and 982 transitions. [2023-08-30 02:36:40,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 98 transitions, 411 flow [2023-08-30 02:36:40,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 98 transitions, 393 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-30 02:36:40,586 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 185 flow [2023-08-30 02:36:40,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=185, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2023-08-30 02:36:40,586 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 0 predicate places. [2023-08-30 02:36:40,586 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 185 flow [2023-08-30 02:36:40,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 230.5) internal successors, (922), 4 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:36:40,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:36:40,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:36:40,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2023-08-30 02:36:40,587 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 19 more)] === [2023-08-30 02:36:40,587 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:36:40,587 INFO L85 PathProgramCache]: Analyzing trace with hash -306455640, now seen corresponding path program 1 times [2023-08-30 02:36:40,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:36:40,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768345837] [2023-08-30 02:36:40,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:36:40,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:36:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:36:40,605 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-30 02:36:40,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:36:40,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768345837] [2023-08-30 02:36:40,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768345837] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:36:40,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:36:40,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:36:40,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805835170] [2023-08-30 02:36:40,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:36:40,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:36:40,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:36:40,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:36:40,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:36:40,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 534 [2023-08-30 02:36:40,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:36:40,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:36:40,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 534 [2023-08-30 02:36:40,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:36:53,232 INFO L130 PetriNetUnfolder]: 115331/157721 cut-off events. [2023-08-30 02:36:53,232 INFO L131 PetriNetUnfolder]: For 33218/33218 co-relation queries the response was YES. [2023-08-30 02:36:53,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334719 conditions, 157721 events. 115331/157721 cut-off events. For 33218/33218 co-relation queries the response was YES. Maximal size of possible extension queue 5868. Compared 1129631 event pairs, 67371 based on Foata normal form. 3628/124562 useless extension candidates. Maximal degree in co-relation 334704. Up to 117208 conditions per place. [2023-08-30 02:36:54,668 INFO L137 encePairwiseOnDemand]: 531/534 looper letters, 67 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2023-08-30 02:36:54,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 97 transitions, 411 flow [2023-08-30 02:36:54,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:36:54,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:36:54,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 760 transitions. [2023-08-30 02:36:54,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47440699126092384 [2023-08-30 02:36:54,669 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 760 transitions. [2023-08-30 02:36:54,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 760 transitions. [2023-08-30 02:36:54,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:36:54,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 760 transitions. [2023-08-30 02:36:54,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:36:54,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 534.0) internal successors, (2136), 4 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:36:54,671 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 534.0) internal successors, (2136), 4 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:36:54,672 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 185 flow. Second operand 3 states and 760 transitions. [2023-08-30 02:36:54,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 97 transitions, 411 flow [2023-08-30 02:36:54,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 97 transitions, 401 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 02:36:54,713 INFO L231 Difference]: Finished difference. Result has 75 places, 67 transitions, 179 flow [2023-08-30 02:36:54,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=179, PETRI_PLACES=75, PETRI_TRANSITIONS=67} [2023-08-30 02:36:54,713 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 0 predicate places. [2023-08-30 02:36:54,713 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 67 transitions, 179 flow [2023-08-30 02:36:54,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:36:54,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:36:54,714 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:36:54,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2023-08-30 02:36:54,714 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 19 more)] === [2023-08-30 02:36:54,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:36:54,714 INFO L85 PathProgramCache]: Analyzing trace with hash 504800000, now seen corresponding path program 1 times [2023-08-30 02:36:54,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:36:54,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495278808] [2023-08-30 02:36:54,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:36:54,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:36:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:36:54,838 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-30 02:36:54,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:36:54,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495278808] [2023-08-30 02:36:54,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495278808] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:36:54,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70675217] [2023-08-30 02:36:54,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:36:54,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:36:54,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:36:54,839 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-30 02:36:54,843 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-30 02:36:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:36:54,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-30 02:36:54,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:36:54,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:36:54,930 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-30 02:36:55,018 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-30 02:36:55,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:36:55,082 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-30 02:36:55,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70675217] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:36:55,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:36:55,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2023-08-30 02:36:55,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725486514] [2023-08-30 02:36:55,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:36:55,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 02:36:55,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:36:55,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 02:36:55,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-08-30 02:36:55,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 534 [2023-08-30 02:36:55,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 67 transitions, 179 flow. Second operand has 11 states, 11 states have (on average 227.9090909090909) internal successors, (2507), 11 states have internal predecessors, (2507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:36:55,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:36:55,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 534 [2023-08-30 02:36:55,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:37:14,835 INFO L130 PetriNetUnfolder]: 182647/253987 cut-off events. [2023-08-30 02:37:14,835 INFO L131 PetriNetUnfolder]: For 39085/39085 co-relation queries the response was YES. [2023-08-30 02:37:15,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530332 conditions, 253987 events. 182647/253987 cut-off events. For 39085/39085 co-relation queries the response was YES. Maximal size of possible extension queue 9596. Compared 2004254 event pairs, 69579 based on Foata normal form. 0/196357 useless extension candidates. Maximal degree in co-relation 530318. Up to 117211 conditions per place. [2023-08-30 02:37:17,115 INFO L137 encePairwiseOnDemand]: 530/534 looper letters, 97 selfloop transitions, 4 changer transitions 0/129 dead transitions. [2023-08-30 02:37:17,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 129 transitions, 557 flow [2023-08-30 02:37:17,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:37:17,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:37:17,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1226 transitions. [2023-08-30 02:37:17,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4591760299625468 [2023-08-30 02:37:17,117 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1226 transitions. [2023-08-30 02:37:17,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1226 transitions. [2023-08-30 02:37:17,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:37:17,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1226 transitions. [2023-08-30 02:37:17,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 245.2) internal successors, (1226), 5 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:37:17,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 534.0) internal successors, (3204), 6 states have internal predecessors, (3204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:37:17,120 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 534.0) internal successors, (3204), 6 states have internal predecessors, (3204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:37:17,120 INFO L175 Difference]: Start difference. First operand has 75 places, 67 transitions, 179 flow. Second operand 5 states and 1226 transitions. [2023-08-30 02:37:17,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 129 transitions, 557 flow [2023-08-30 02:37:17,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 129 transitions, 545 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:37:17,155 INFO L231 Difference]: Finished difference. Result has 78 places, 68 transitions, 193 flow [2023-08-30 02:37:17,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=78, PETRI_TRANSITIONS=68} [2023-08-30 02:37:17,155 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 3 predicate places. [2023-08-30 02:37:17,155 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 68 transitions, 193 flow [2023-08-30 02:37:17,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 227.9090909090909) internal successors, (2507), 11 states have internal predecessors, (2507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:37:17,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:37:17,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:37:17,163 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-30 02:37:17,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:37:17,361 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 19 more)] === [2023-08-30 02:37:17,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:37:17,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1225796203, now seen corresponding path program 1 times [2023-08-30 02:37:17,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:37:17,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994419952] [2023-08-30 02:37:17,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:37:17,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:37:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:37:17,386 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-30 02:37:17,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:37:17,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994419952] [2023-08-30 02:37:17,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994419952] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:37:17,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:37:17,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:37:17,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137840360] [2023-08-30 02:37:17,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:37:17,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:37:17,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:37:17,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:37:17,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:37:17,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 534 [2023-08-30 02:37:17,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 68 transitions, 193 flow. Second operand has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:37:17,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:37:17,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 534 [2023-08-30 02:37:17,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:38:19,324 INFO L130 PetriNetUnfolder]: 560419/746139 cut-off events. [2023-08-30 02:38:19,324 INFO L131 PetriNetUnfolder]: For 159514/159514 co-relation queries the response was YES. [2023-08-30 02:38:22,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1576860 conditions, 746139 events. 560419/746139 cut-off events. For 159514/159514 co-relation queries the response was YES. Maximal size of possible extension queue 26678. Compared 5857651 event pairs, 300249 based on Foata normal form. 0/606751 useless extension candidates. Maximal degree in co-relation 1576844. Up to 508158 conditions per place.