./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 675e4a71573eb5ca191c78078c954ea41743d39a46f0fa586376ee48e7dc4190 --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-31 02:57:02,094 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 02:57:02,095 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 02:57:02,120 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 02:57:02,121 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 02:57:02,131 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 02:57:02,132 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 02:57:02,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 02:57:02,135 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 02:57:02,136 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 02:57:02,137 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 02:57:02,138 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 02:57:02,138 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 02:57:02,139 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 02:57:02,140 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 02:57:02,140 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 02:57:02,141 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 02:57:02,142 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 02:57:02,143 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 02:57:02,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 02:57:02,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 02:57:02,147 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 02:57:02,147 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 02:57:02,148 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 02:57:02,151 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 02:57:02,151 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 02:57:02,151 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 02:57:02,152 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 02:57:02,152 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 02:57:02,153 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 02:57:02,153 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 02:57:02,154 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 02:57:02,155 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 02:57:02,155 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 02:57:02,156 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 02:57:02,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 02:57:02,157 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 02:57:02,157 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 02:57:02,157 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 02:57:02,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 02:57:02,159 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 02:57:02,160 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-31 02:57:02,178 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 02:57:02,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 02:57:02,179 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 02:57:02,179 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 02:57:02,180 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 02:57:02,180 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 02:57:02,181 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 02:57:02,181 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 02:57:02,181 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 02:57:02,182 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 02:57:02,182 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 02:57:02,182 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 02:57:02,182 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 02:57:02,183 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 02:57:02,183 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-31 02:57:02,183 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 02:57:02,183 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-31 02:57:02,184 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 02:57:02,184 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-31 02:57:02,184 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 02:57:02,184 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-31 02:57:02,185 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 02:57:02,185 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 02:57:02,185 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 02:57:02,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 02:57:02,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 02:57:02,186 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 02:57:02,186 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-31 02:57:02,186 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 02:57:02,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 02:57:02,187 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 02:57:02,187 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-31 02:57:02,187 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 02:57:02,188 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 02:57:02,188 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 02:57:02,188 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 675e4a71573eb5ca191c78078c954ea41743d39a46f0fa586376ee48e7dc4190 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-31 02:57:02,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 02:57:02,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 02:57:02,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 02:57:02,532 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 02:57:02,532 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 02:57:02,537 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series.wvr.c [2023-08-31 02:57:03,763 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 02:57:03,988 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 02:57:03,989 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series.wvr.c [2023-08-31 02:57:03,996 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b4799d0f/a619f63932074a6bbeacc2a255fa0137/FLAGeaa1039c5 [2023-08-31 02:57:04,006 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b4799d0f/a619f63932074a6bbeacc2a255fa0137 [2023-08-31 02:57:04,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 02:57:04,009 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 02:57:04,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 02:57:04,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 02:57:04,013 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 02:57:04,014 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 02:57:04" (1/1) ... [2023-08-31 02:57:04,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c93a48b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:57:04, skipping insertion in model container [2023-08-31 02:57:04,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 02:57:04" (1/1) ... [2023-08-31 02:57:04,020 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 02:57:04,038 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 02:57:04,200 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series.wvr.c[4351,4364] [2023-08-31 02:57:04,223 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 02:57:04,234 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 02:57:04,277 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series.wvr.c[4351,4364] [2023-08-31 02:57:04,292 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 02:57:04,307 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 02:57:04,307 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 02:57:04,313 INFO L208 MainTranslator]: Completed translation [2023-08-31 02:57:04,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:57:04 WrapperNode [2023-08-31 02:57:04,314 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 02:57:04,315 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 02:57:04,315 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 02:57:04,316 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 02:57:04,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:57:04" (1/1) ... [2023-08-31 02:57:04,342 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:57:04" (1/1) ... [2023-08-31 02:57:04,385 INFO L138 Inliner]: procedures = 27, calls = 87, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 358 [2023-08-31 02:57:04,391 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 02:57:04,392 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 02:57:04,392 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 02:57:04,393 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 02:57:04,400 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:57:04" (1/1) ... [2023-08-31 02:57:04,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:57:04" (1/1) ... [2023-08-31 02:57:04,420 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:57:04" (1/1) ... [2023-08-31 02:57:04,427 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:57:04" (1/1) ... [2023-08-31 02:57:04,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:57:04" (1/1) ... [2023-08-31 02:57:04,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:57:04" (1/1) ... [2023-08-31 02:57:04,481 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:57:04" (1/1) ... [2023-08-31 02:57:04,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:57:04" (1/1) ... [2023-08-31 02:57:04,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 02:57:04,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 02:57:04,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 02:57:04,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 02:57:04,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:57:04" (1/1) ... [2023-08-31 02:57:04,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 02:57:04,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:57:04,535 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-31 02:57:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 02:57:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 02:57:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 02:57:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-31 02:57:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-31 02:57:04,574 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-31 02:57:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-31 02:57:04,574 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-31 02:57:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-31 02:57:04,574 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-31 02:57:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-31 02:57:04,574 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-31 02:57:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 02:57:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 02:57:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 02:57:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-31 02:57:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 02:57:04,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 02:57:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 02:57:04,577 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 02:57:04,565 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-31 02:57:04,719 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 02:57:04,721 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 02:57:05,203 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 02:57:05,460 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 02:57:05,460 INFO L302 CfgBuilder]: Removed 7 assume(true) statements. [2023-08-31 02:57:05,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 02:57:05 BoogieIcfgContainer [2023-08-31 02:57:05,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 02:57:05,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 02:57:05,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 02:57:05,468 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 02:57:05,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 02:57:04" (1/3) ... [2023-08-31 02:57:05,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69174068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 02:57:05, skipping insertion in model container [2023-08-31 02:57:05,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:57:04" (2/3) ... [2023-08-31 02:57:05,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69174068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 02:57:05, skipping insertion in model container [2023-08-31 02:57:05,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 02:57:05" (3/3) ... [2023-08-31 02:57:05,471 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series.wvr.c [2023-08-31 02:57:05,477 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-31 02:57:05,486 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 02:57:05,486 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-31 02:57:05,486 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 02:57:05,569 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-31 02:57:05,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 244 places, 253 transitions, 538 flow [2023-08-31 02:57:05,724 INFO L130 PetriNetUnfolder]: 22/249 cut-off events. [2023-08-31 02:57:05,725 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-31 02:57:05,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 249 events. 22/249 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 140 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 212. Up to 2 conditions per place. [2023-08-31 02:57:05,731 INFO L82 GeneralOperation]: Start removeDead. Operand has 244 places, 253 transitions, 538 flow [2023-08-31 02:57:05,740 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 237 transitions, 498 flow [2023-08-31 02:57:05,743 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 02:57:05,757 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 228 places, 237 transitions, 498 flow [2023-08-31 02:57:05,760 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 228 places, 237 transitions, 498 flow [2023-08-31 02:57:05,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 228 places, 237 transitions, 498 flow [2023-08-31 02:57:05,816 INFO L130 PetriNetUnfolder]: 22/237 cut-off events. [2023-08-31 02:57:05,817 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-31 02:57:05,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 237 events. 22/237 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 139 event pairs, 0 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 212. Up to 2 conditions per place. [2023-08-31 02:57:05,822 INFO L119 LiptonReduction]: Number of co-enabled transitions 2000 [2023-08-31 02:57:14,301 INFO L134 LiptonReduction]: Checked pairs total: 4059 [2023-08-31 02:57:14,301 INFO L136 LiptonReduction]: Total number of compositions: 236 [2023-08-31 02:57:14,314 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 02:57:14,319 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7a146e87, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 02:57:14,320 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-31 02:57:14,328 INFO L130 PetriNetUnfolder]: 7/38 cut-off events. [2023-08-31 02:57:14,328 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-31 02:57:14,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:57:14,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 02:57:14,330 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-31 02:57:14,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:57:14,334 INFO L85 PathProgramCache]: Analyzing trace with hash -823670804, now seen corresponding path program 1 times [2023-08-31 02:57:14,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:57:14,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916414347] [2023-08-31 02:57:14,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:57:14,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:57:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:57:14,830 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-31 02:57:14,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:57:14,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916414347] [2023-08-31 02:57:14,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916414347] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:57:14,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:57:14,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 02:57:14,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238033377] [2023-08-31 02:57:14,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:57:14,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 02:57:14,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:57:14,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 02:57:14,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 02:57:14,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 489 [2023-08-31 02:57:14,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:14,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:57:14,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 489 [2023-08-31 02:57:14,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:57:15,391 INFO L130 PetriNetUnfolder]: 2607/3584 cut-off events. [2023-08-31 02:57:15,392 INFO L131 PetriNetUnfolder]: For 189/189 co-relation queries the response was YES. [2023-08-31 02:57:15,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7119 conditions, 3584 events. 2607/3584 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 16023 event pairs, 498 based on Foata normal form. 1/2296 useless extension candidates. Maximal degree in co-relation 5886. Up to 2275 conditions per place. [2023-08-31 02:57:15,415 INFO L137 encePairwiseOnDemand]: 485/489 looper letters, 49 selfloop transitions, 3 changer transitions 1/59 dead transitions. [2023-08-31 02:57:15,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 59 transitions, 263 flow [2023-08-31 02:57:15,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 02:57:15,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 02:57:15,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 720 transitions. [2023-08-31 02:57:15,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49079754601226994 [2023-08-31 02:57:15,437 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 720 transitions. [2023-08-31 02:57:15,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 720 transitions. [2023-08-31 02:57:15,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:57:15,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 720 transitions. [2023-08-31 02:57:15,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 240.0) internal successors, (720), 3 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-31 02:57:15,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 489.0) internal successors, (1956), 4 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:15,457 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 489.0) internal successors, (1956), 4 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:15,459 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 102 flow. Second operand 3 states and 720 transitions. [2023-08-31 02:57:15,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 59 transitions, 263 flow [2023-08-31 02:57:15,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 59 transitions, 237 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-31 02:57:15,472 INFO L231 Difference]: Finished difference. Result has 40 places, 41 transitions, 105 flow [2023-08-31 02:57:15,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=40, PETRI_TRANSITIONS=41} [2023-08-31 02:57:15,479 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2023-08-31 02:57:15,482 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 41 transitions, 105 flow [2023-08-31 02:57:15,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:15,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:57:15,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 02:57:15,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 02:57:15,484 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-31 02:57:15,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:57:15,486 INFO L85 PathProgramCache]: Analyzing trace with hash 723466093, now seen corresponding path program 1 times [2023-08-31 02:57:15,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:57:15,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162284763] [2023-08-31 02:57:15,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:57:15,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:57:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:57:15,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:57:15,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:57:15,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162284763] [2023-08-31 02:57:15,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162284763] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:57:15,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:57:15,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 02:57:15,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788055496] [2023-08-31 02:57:15,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:57:15,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 02:57:15,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:57:15,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 02:57:15,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 02:57:15,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 489 [2023-08-31 02:57:15,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 41 transitions, 105 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:15,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:57:15,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 489 [2023-08-31 02:57:15,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:57:16,105 INFO L130 PetriNetUnfolder]: 2710/3667 cut-off events. [2023-08-31 02:57:16,106 INFO L131 PetriNetUnfolder]: For 718/718 co-relation queries the response was YES. [2023-08-31 02:57:16,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8148 conditions, 3667 events. 2710/3667 cut-off events. For 718/718 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 16521 event pairs, 624 based on Foata normal form. 118/3118 useless extension candidates. Maximal degree in co-relation 2697. Up to 2597 conditions per place. [2023-08-31 02:57:16,126 INFO L137 encePairwiseOnDemand]: 486/489 looper letters, 57 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-08-31 02:57:16,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 65 transitions, 285 flow [2023-08-31 02:57:16,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 02:57:16,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 02:57:16,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2023-08-31 02:57:16,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4867075664621677 [2023-08-31 02:57:16,129 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 714 transitions. [2023-08-31 02:57:16,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 714 transitions. [2023-08-31 02:57:16,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:57:16,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 714 transitions. [2023-08-31 02:57:16,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:16,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 489.0) internal successors, (1956), 4 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:16,135 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 489.0) internal successors, (1956), 4 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:16,135 INFO L175 Difference]: Start difference. First operand has 40 places, 41 transitions, 105 flow. Second operand 3 states and 714 transitions. [2023-08-31 02:57:16,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 65 transitions, 285 flow [2023-08-31 02:57:16,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 65 transitions, 281 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 02:57:16,138 INFO L231 Difference]: Finished difference. Result has 42 places, 42 transitions, 116 flow [2023-08-31 02:57:16,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=42, PETRI_TRANSITIONS=42} [2023-08-31 02:57:16,138 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2023-08-31 02:57:16,139 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 42 transitions, 116 flow [2023-08-31 02:57:16,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:16,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:57:16,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 02:57:16,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 02:57:16,140 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-31 02:57:16,140 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:57:16,141 INFO L85 PathProgramCache]: Analyzing trace with hash -213191495, now seen corresponding path program 1 times [2023-08-31 02:57:16,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:57:16,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027859405] [2023-08-31 02:57:16,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:57:16,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:57:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:57:16,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:57:16,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:57:16,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027859405] [2023-08-31 02:57:16,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027859405] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:57:16,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:57:16,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 02:57:16,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221562027] [2023-08-31 02:57:16,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:57:16,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 02:57:16,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:57:16,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 02:57:16,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 02:57:16,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 489 [2023-08-31 02:57:16,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 42 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:16,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:57:16,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 489 [2023-08-31 02:57:16,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:57:16,727 INFO L130 PetriNetUnfolder]: 2668/3764 cut-off events. [2023-08-31 02:57:16,727 INFO L131 PetriNetUnfolder]: For 1536/1536 co-relation queries the response was YES. [2023-08-31 02:57:16,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8737 conditions, 3764 events. 2668/3764 cut-off events. For 1536/1536 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 18375 event pairs, 655 based on Foata normal form. 74/3473 useless extension candidates. Maximal degree in co-relation 6349. Up to 2665 conditions per place. [2023-08-31 02:57:16,746 INFO L137 encePairwiseOnDemand]: 486/489 looper letters, 57 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-08-31 02:57:16,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 65 transitions, 301 flow [2023-08-31 02:57:16,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 02:57:16,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 02:57:16,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 712 transitions. [2023-08-31 02:57:16,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48534423994546694 [2023-08-31 02:57:16,749 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 712 transitions. [2023-08-31 02:57:16,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 712 transitions. [2023-08-31 02:57:16,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:57:16,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 712 transitions. [2023-08-31 02:57:16,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:16,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 489.0) internal successors, (1956), 4 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:16,755 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 489.0) internal successors, (1956), 4 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:16,755 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 116 flow. Second operand 3 states and 712 transitions. [2023-08-31 02:57:16,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 65 transitions, 301 flow [2023-08-31 02:57:16,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 65 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 02:57:16,757 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 128 flow [2023-08-31 02:57:16,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2023-08-31 02:57:16,758 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2023-08-31 02:57:16,758 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 128 flow [2023-08-31 02:57:16,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:16,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:57:16,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 02:57:16,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 02:57:16,760 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-31 02:57:16,760 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:57:16,760 INFO L85 PathProgramCache]: Analyzing trace with hash -326780758, now seen corresponding path program 1 times [2023-08-31 02:57:16,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:57:16,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422447395] [2023-08-31 02:57:16,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:57:16,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:57:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:57:16,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:57:16,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:57:16,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422447395] [2023-08-31 02:57:16,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422447395] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:57:16,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:57:16,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 02:57:16,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419433798] [2023-08-31 02:57:16,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:57:16,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 02:57:16,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:57:16,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 02:57:16,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 02:57:16,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 489 [2023-08-31 02:57:16,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 215.75) internal successors, (863), 4 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:16,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:57:16,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 489 [2023-08-31 02:57:16,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:57:17,484 INFO L130 PetriNetUnfolder]: 3191/4597 cut-off events. [2023-08-31 02:57:17,484 INFO L131 PetriNetUnfolder]: For 2513/2513 co-relation queries the response was YES. [2023-08-31 02:57:17,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11225 conditions, 4597 events. 3191/4597 cut-off events. For 2513/2513 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 24355 event pairs, 2374 based on Foata normal form. 95/4561 useless extension candidates. Maximal degree in co-relation 5018. Up to 3497 conditions per place. [2023-08-31 02:57:17,509 INFO L137 encePairwiseOnDemand]: 485/489 looper letters, 65 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2023-08-31 02:57:17,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 74 transitions, 349 flow [2023-08-31 02:57:17,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 02:57:17,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 02:57:17,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 899 transitions. [2023-08-31 02:57:17,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4596114519427403 [2023-08-31 02:57:17,513 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 899 transitions. [2023-08-31 02:57:17,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 899 transitions. [2023-08-31 02:57:17,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:57:17,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 899 transitions. [2023-08-31 02:57:17,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 224.75) internal successors, (899), 4 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:17,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 489.0) internal successors, (2445), 5 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:17,520 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 489.0) internal successors, (2445), 5 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:17,520 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 128 flow. Second operand 4 states and 899 transitions. [2023-08-31 02:57:17,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 74 transitions, 349 flow [2023-08-31 02:57:17,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 74 transitions, 346 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 02:57:17,523 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 146 flow [2023-08-31 02:57:17,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2023-08-31 02:57:17,524 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2023-08-31 02:57:17,524 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 146 flow [2023-08-31 02:57:17,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 215.75) internal successors, (863), 4 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:17,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:57:17,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 02:57:17,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 02:57:17,525 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-31 02:57:17,525 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:57:17,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1525607470, now seen corresponding path program 1 times [2023-08-31 02:57:17,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:57:17,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283912574] [2023-08-31 02:57:17,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:57:17,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:57:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:57:17,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:57:17,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:57:17,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283912574] [2023-08-31 02:57:17,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283912574] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:57:17,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:57:17,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 02:57:17,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300538649] [2023-08-31 02:57:17,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:57:17,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 02:57:17,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:57:17,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 02:57:17,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 02:57:17,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 489 [2023-08-31 02:57:17,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 215.75) internal successors, (863), 4 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:17,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:57:17,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 489 [2023-08-31 02:57:17,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:57:18,292 INFO L130 PetriNetUnfolder]: 3933/5811 cut-off events. [2023-08-31 02:57:18,293 INFO L131 PetriNetUnfolder]: For 3196/3196 co-relation queries the response was YES. [2023-08-31 02:57:18,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13895 conditions, 5811 events. 3933/5811 cut-off events. For 3196/3196 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 33531 event pairs, 3012 based on Foata normal form. 166/5823 useless extension candidates. Maximal degree in co-relation 11262. Up to 4410 conditions per place. [2023-08-31 02:57:18,323 INFO L137 encePairwiseOnDemand]: 485/489 looper letters, 64 selfloop transitions, 4 changer transitions 0/74 dead transitions. [2023-08-31 02:57:18,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 74 transitions, 364 flow [2023-08-31 02:57:18,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 02:57:18,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 02:57:18,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 897 transitions. [2023-08-31 02:57:18,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45858895705521474 [2023-08-31 02:57:18,326 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 897 transitions. [2023-08-31 02:57:18,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 897 transitions. [2023-08-31 02:57:18,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:57:18,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 897 transitions. [2023-08-31 02:57:18,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 224.25) internal successors, (897), 4 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:18,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 489.0) internal successors, (2445), 5 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:18,333 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 489.0) internal successors, (2445), 5 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:18,333 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 146 flow. Second operand 4 states and 897 transitions. [2023-08-31 02:57:18,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 74 transitions, 364 flow [2023-08-31 02:57:18,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 74 transitions, 360 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-31 02:57:18,336 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 165 flow [2023-08-31 02:57:18,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2023-08-31 02:57:18,337 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2023-08-31 02:57:18,337 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 165 flow [2023-08-31 02:57:18,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 215.75) internal successors, (863), 4 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:18,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:57:18,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 02:57:18,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 02:57:18,339 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-31 02:57:18,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:57:18,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1648494691, now seen corresponding path program 1 times [2023-08-31 02:57:18,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:57:18,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887914527] [2023-08-31 02:57:18,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:57:18,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:57:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:57:18,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 02:57:18,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:57:18,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887914527] [2023-08-31 02:57:18,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887914527] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:57:18,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:57:18,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:57:18,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066699101] [2023-08-31 02:57:18,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:57:18,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 02:57:18,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:57:18,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 02:57:18,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-31 02:57:18,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 489 [2023-08-31 02:57:18,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 165 flow. Second operand has 6 states, 6 states have (on average 209.83333333333334) internal successors, (1259), 6 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:18,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:57:18,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 489 [2023-08-31 02:57:18,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:57:19,876 INFO L130 PetriNetUnfolder]: 7243/10629 cut-off events. [2023-08-31 02:57:19,876 INFO L131 PetriNetUnfolder]: For 4981/4981 co-relation queries the response was YES. [2023-08-31 02:57:19,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25276 conditions, 10629 events. 7243/10629 cut-off events. For 4981/4981 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 66846 event pairs, 2526 based on Foata normal form. 126/10585 useless extension candidates. Maximal degree in co-relation 17966. Up to 3867 conditions per place. [2023-08-31 02:57:19,924 INFO L137 encePairwiseOnDemand]: 482/489 looper letters, 105 selfloop transitions, 7 changer transitions 0/117 dead transitions. [2023-08-31 02:57:19,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 117 transitions, 601 flow [2023-08-31 02:57:19,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 02:57:19,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 02:57:19,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1329 transitions. [2023-08-31 02:57:19,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45296523517382414 [2023-08-31 02:57:19,929 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1329 transitions. [2023-08-31 02:57:19,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1329 transitions. [2023-08-31 02:57:19,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:57:19,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1329 transitions. [2023-08-31 02:57:19,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 221.5) internal successors, (1329), 6 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:19,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 489.0) internal successors, (3423), 7 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:19,938 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 489.0) internal successors, (3423), 7 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:19,938 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 165 flow. Second operand 6 states and 1329 transitions. [2023-08-31 02:57:19,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 117 transitions, 601 flow [2023-08-31 02:57:19,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 117 transitions, 596 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-31 02:57:19,945 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 204 flow [2023-08-31 02:57:19,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=204, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2023-08-31 02:57:19,947 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2023-08-31 02:57:19,947 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 204 flow [2023-08-31 02:57:19,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 209.83333333333334) internal successors, (1259), 6 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:19,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:57:19,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 02:57:19,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 02:57:19,949 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-31 02:57:19,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:57:19,950 INFO L85 PathProgramCache]: Analyzing trace with hash -715595175, now seen corresponding path program 1 times [2023-08-31 02:57:19,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:57:19,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125276876] [2023-08-31 02:57:19,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:57:19,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:57:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:57:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 02:57:20,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:57:20,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125276876] [2023-08-31 02:57:20,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125276876] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:57:20,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:57:20,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:57:20,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177671097] [2023-08-31 02:57:20,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:57:20,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 02:57:20,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:57:20,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 02:57:20,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-31 02:57:20,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 489 [2023-08-31 02:57:20,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 204 flow. Second operand has 6 states, 6 states have (on average 209.83333333333334) internal successors, (1259), 6 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:20,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:57:20,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 489 [2023-08-31 02:57:20,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:57:21,483 INFO L130 PetriNetUnfolder]: 7179/10606 cut-off events. [2023-08-31 02:57:21,483 INFO L131 PetriNetUnfolder]: For 6220/6323 co-relation queries the response was YES. [2023-08-31 02:57:21,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26030 conditions, 10606 events. 7179/10606 cut-off events. For 6220/6323 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 66934 event pairs, 3230 based on Foata normal form. 156/10654 useless extension candidates. Maximal degree in co-relation 21090. Up to 5061 conditions per place. [2023-08-31 02:57:21,539 INFO L137 encePairwiseOnDemand]: 482/489 looper letters, 65 selfloop transitions, 5 changer transitions 32/107 dead transitions. [2023-08-31 02:57:21,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 107 transitions, 566 flow [2023-08-31 02:57:21,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 02:57:21,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 02:57:21,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1320 transitions. [2023-08-31 02:57:21,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4498977505112474 [2023-08-31 02:57:21,543 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1320 transitions. [2023-08-31 02:57:21,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1320 transitions. [2023-08-31 02:57:21,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:57:21,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1320 transitions. [2023-08-31 02:57:21,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:21,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 489.0) internal successors, (3423), 7 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:21,553 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 489.0) internal successors, (3423), 7 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:21,553 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 204 flow. Second operand 6 states and 1320 transitions. [2023-08-31 02:57:21,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 107 transitions, 566 flow [2023-08-31 02:57:21,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 107 transitions, 561 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-31 02:57:21,557 INFO L231 Difference]: Finished difference. Result has 67 places, 50 transitions, 211 flow [2023-08-31 02:57:21,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=211, PETRI_PLACES=67, PETRI_TRANSITIONS=50} [2023-08-31 02:57:21,561 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 22 predicate places. [2023-08-31 02:57:21,562 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 50 transitions, 211 flow [2023-08-31 02:57:21,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 209.83333333333334) internal successors, (1259), 6 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:21,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:57:21,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 02:57:21,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 02:57:21,563 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-31 02:57:21,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:57:21,563 INFO L85 PathProgramCache]: Analyzing trace with hash 2096325821, now seen corresponding path program 1 times [2023-08-31 02:57:21,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:57:21,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74009527] [2023-08-31 02:57:21,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:57:21,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:57:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:57:21,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 02:57:21,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:57:21,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74009527] [2023-08-31 02:57:21,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74009527] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:57:21,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:57:21,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:57:21,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840732866] [2023-08-31 02:57:21,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:57:21,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 02:57:21,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:57:21,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 02:57:21,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 02:57:22,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 489 [2023-08-31 02:57:22,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 50 transitions, 211 flow. Second operand has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:22,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:57:22,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 489 [2023-08-31 02:57:22,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:57:23,142 INFO L130 PetriNetUnfolder]: 8043/11090 cut-off events. [2023-08-31 02:57:23,143 INFO L131 PetriNetUnfolder]: For 7898/7924 co-relation queries the response was YES. [2023-08-31 02:57:23,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29546 conditions, 11090 events. 8043/11090 cut-off events. For 7898/7924 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 61199 event pairs, 1720 based on Foata normal form. 584/11614 useless extension candidates. Maximal degree in co-relation 24684. Up to 5964 conditions per place. [2023-08-31 02:57:23,210 INFO L137 encePairwiseOnDemand]: 481/489 looper letters, 90 selfloop transitions, 9 changer transitions 11/114 dead transitions. [2023-08-31 02:57:23,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 114 transitions, 665 flow [2023-08-31 02:57:23,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 02:57:23,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 02:57:23,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1498 transitions. [2023-08-31 02:57:23,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4376278118609407 [2023-08-31 02:57:23,214 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1498 transitions. [2023-08-31 02:57:23,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1498 transitions. [2023-08-31 02:57:23,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:57:23,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1498 transitions. [2023-08-31 02:57:23,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:23,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 489.0) internal successors, (3912), 8 states have internal predecessors, (3912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:23,224 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 489.0) internal successors, (3912), 8 states have internal predecessors, (3912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:23,224 INFO L175 Difference]: Start difference. First operand has 67 places, 50 transitions, 211 flow. Second operand 7 states and 1498 transitions. [2023-08-31 02:57:23,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 114 transitions, 665 flow [2023-08-31 02:57:23,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 114 transitions, 641 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-08-31 02:57:23,232 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 255 flow [2023-08-31 02:57:23,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2023-08-31 02:57:23,233 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 21 predicate places. [2023-08-31 02:57:23,233 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 255 flow [2023-08-31 02:57:23,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:23,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:57:23,234 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 02:57:23,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 02:57:23,234 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-31 02:57:23,235 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:57:23,235 INFO L85 PathProgramCache]: Analyzing trace with hash -707382063, now seen corresponding path program 1 times [2023-08-31 02:57:23,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:57:23,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728962531] [2023-08-31 02:57:23,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:57:23,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:57:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:57:23,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 02:57:23,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:57:23,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728962531] [2023-08-31 02:57:23,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728962531] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:57:23,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776693719] [2023-08-31 02:57:23,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:57:23,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:57:23,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:57:23,519 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-31 02:57:23,523 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-31 02:57:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:57:23,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-31 02:57:23,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:57:23,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 02:57:23,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:57:23,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 02:57:23,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776693719] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-31 02:57:23,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-31 02:57:23,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 5] total 14 [2023-08-31 02:57:23,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596772507] [2023-08-31 02:57:23,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:57:23,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 02:57:23,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:57:23,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 02:57:23,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-08-31 02:57:24,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 489 [2023-08-31 02:57:24,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 255 flow. Second operand has 7 states, 7 states have (on average 195.57142857142858) internal successors, (1369), 7 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:24,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:57:24,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 489 [2023-08-31 02:57:24,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:57:25,325 INFO L130 PetriNetUnfolder]: 6931/9341 cut-off events. [2023-08-31 02:57:25,326 INFO L131 PetriNetUnfolder]: For 8926/8926 co-relation queries the response was YES. [2023-08-31 02:57:25,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27807 conditions, 9341 events. 6931/9341 cut-off events. For 8926/8926 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 47070 event pairs, 1335 based on Foata normal form. 396/9735 useless extension candidates. Maximal degree in co-relation 24197. Up to 3536 conditions per place. [2023-08-31 02:57:25,407 INFO L137 encePairwiseOnDemand]: 479/489 looper letters, 163 selfloop transitions, 27 changer transitions 1/194 dead transitions. [2023-08-31 02:57:25,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 194 transitions, 1240 flow [2023-08-31 02:57:25,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-31 02:57:25,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-31 02:57:25,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2242 transitions. [2023-08-31 02:57:25,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4168060977876929 [2023-08-31 02:57:25,414 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2242 transitions. [2023-08-31 02:57:25,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2242 transitions. [2023-08-31 02:57:25,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:57:25,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2242 transitions. [2023-08-31 02:57:25,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 203.8181818181818) internal successors, (2242), 11 states have internal predecessors, (2242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:25,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 489.0) internal successors, (5868), 12 states have internal predecessors, (5868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:25,427 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 489.0) internal successors, (5868), 12 states have internal predecessors, (5868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:25,427 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 255 flow. Second operand 11 states and 2242 transitions. [2023-08-31 02:57:25,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 194 transitions, 1240 flow [2023-08-31 02:57:25,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 194 transitions, 1211 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-08-31 02:57:25,452 INFO L231 Difference]: Finished difference. Result has 76 places, 73 transitions, 427 flow [2023-08-31 02:57:25,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=427, PETRI_PLACES=76, PETRI_TRANSITIONS=73} [2023-08-31 02:57:25,453 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 31 predicate places. [2023-08-31 02:57:25,453 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 427 flow [2023-08-31 02:57:25,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 195.57142857142858) internal successors, (1369), 7 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:25,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:57:25,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 02:57:25,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-31 02:57:25,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:57:25,668 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-31 02:57:25,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:57:25,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1366342543, now seen corresponding path program 1 times [2023-08-31 02:57:25,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:57:25,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253346449] [2023-08-31 02:57:25,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:57:25,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:57:25,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:57:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-31 02:57:25,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:57:25,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253346449] [2023-08-31 02:57:25,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253346449] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:57:25,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:57:25,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:57:25,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96054874] [2023-08-31 02:57:25,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:57:25,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 02:57:25,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:57:25,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 02:57:25,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-31 02:57:25,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 489 [2023-08-31 02:57:25,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 73 transitions, 427 flow. Second operand has 6 states, 6 states have (on average 218.5) internal successors, (1311), 6 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:25,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:57:25,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 489 [2023-08-31 02:57:25,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:57:27,104 INFO L130 PetriNetUnfolder]: 9922/13074 cut-off events. [2023-08-31 02:57:27,105 INFO L131 PetriNetUnfolder]: For 30042/30078 co-relation queries the response was YES. [2023-08-31 02:57:27,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46140 conditions, 13074 events. 9922/13074 cut-off events. For 30042/30078 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 66469 event pairs, 1483 based on Foata normal form. 234/13282 useless extension candidates. Maximal degree in co-relation 46102. Up to 4518 conditions per place. [2023-08-31 02:57:27,354 INFO L137 encePairwiseOnDemand]: 483/489 looper letters, 125 selfloop transitions, 26 changer transitions 0/156 dead transitions. [2023-08-31 02:57:27,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 156 transitions, 1157 flow [2023-08-31 02:57:27,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 02:57:27,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 02:57:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1372 transitions. [2023-08-31 02:57:27,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4676209952283572 [2023-08-31 02:57:27,358 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1372 transitions. [2023-08-31 02:57:27,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1372 transitions. [2023-08-31 02:57:27,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:57:27,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1372 transitions. [2023-08-31 02:57:27,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 228.66666666666666) internal successors, (1372), 6 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:27,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 489.0) internal successors, (3423), 7 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:27,366 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 489.0) internal successors, (3423), 7 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:27,367 INFO L175 Difference]: Start difference. First operand has 76 places, 73 transitions, 427 flow. Second operand 6 states and 1372 transitions. [2023-08-31 02:57:27,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 156 transitions, 1157 flow [2023-08-31 02:57:27,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 156 transitions, 1111 flow, removed 12 selfloop flow, removed 5 redundant places. [2023-08-31 02:57:27,416 INFO L231 Difference]: Finished difference. Result has 79 places, 89 transitions, 659 flow [2023-08-31 02:57:27,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=659, PETRI_PLACES=79, PETRI_TRANSITIONS=89} [2023-08-31 02:57:27,417 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 34 predicate places. [2023-08-31 02:57:27,417 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 89 transitions, 659 flow [2023-08-31 02:57:27,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 218.5) internal successors, (1311), 6 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:27,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:57:27,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 02:57:27,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 02:57:27,419 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-31 02:57:27,419 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:57:27,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1457187879, now seen corresponding path program 1 times [2023-08-31 02:57:27,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:57:27,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200433005] [2023-08-31 02:57:27,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:57:27,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:57:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:57:27,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-31 02:57:27,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:57:27,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200433005] [2023-08-31 02:57:27,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200433005] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:57:27,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702147962] [2023-08-31 02:57:27,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:57:27,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:57:27,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:57:27,689 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-31 02:57:27,713 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-31 02:57:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:57:27,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-31 02:57:27,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:57:27,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-31 02:57:27,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:57:28,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 02:57:28,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702147962] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-31 02:57:28,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-31 02:57:28,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 5] total 14 [2023-08-31 02:57:28,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569980207] [2023-08-31 02:57:28,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:57:28,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 02:57:28,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:57:28,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 02:57:28,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2023-08-31 02:57:28,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 489 [2023-08-31 02:57:28,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 89 transitions, 659 flow. Second operand has 7 states, 7 states have (on average 196.0) internal successors, (1372), 7 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:28,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:57:28,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 489 [2023-08-31 02:57:28,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:57:30,508 INFO L130 PetriNetUnfolder]: 14337/19035 cut-off events. [2023-08-31 02:57:30,508 INFO L131 PetriNetUnfolder]: For 70118/70162 co-relation queries the response was YES. [2023-08-31 02:57:30,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74954 conditions, 19035 events. 14337/19035 cut-off events. For 70118/70162 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 91563 event pairs, 1720 based on Foata normal form. 1294/20327 useless extension candidates. Maximal degree in co-relation 74914. Up to 8232 conditions per place. [2023-08-31 02:57:30,626 INFO L137 encePairwiseOnDemand]: 478/489 looper letters, 212 selfloop transitions, 55 changer transitions 0/270 dead transitions. [2023-08-31 02:57:30,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 270 transitions, 2518 flow [2023-08-31 02:57:30,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-31 02:57:30,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-31 02:57:30,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2250 transitions. [2023-08-31 02:57:30,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4182933630786392 [2023-08-31 02:57:30,633 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2250 transitions. [2023-08-31 02:57:30,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2250 transitions. [2023-08-31 02:57:30,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:57:30,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2250 transitions. [2023-08-31 02:57:30,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 204.54545454545453) internal successors, (2250), 11 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:30,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 489.0) internal successors, (5868), 12 states have internal predecessors, (5868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:30,645 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 489.0) internal successors, (5868), 12 states have internal predecessors, (5868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:30,645 INFO L175 Difference]: Start difference. First operand has 79 places, 89 transitions, 659 flow. Second operand 11 states and 2250 transitions. [2023-08-31 02:57:30,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 270 transitions, 2518 flow [2023-08-31 02:57:30,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 270 transitions, 2485 flow, removed 16 selfloop flow, removed 1 redundant places. [2023-08-31 02:57:30,754 INFO L231 Difference]: Finished difference. Result has 96 places, 119 transitions, 1130 flow [2023-08-31 02:57:30,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1130, PETRI_PLACES=96, PETRI_TRANSITIONS=119} [2023-08-31 02:57:30,755 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 51 predicate places. [2023-08-31 02:57:30,755 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 119 transitions, 1130 flow [2023-08-31 02:57:30,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 196.0) internal successors, (1372), 7 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:30,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:57:30,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 02:57:30,767 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-31 02:57:30,967 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,SelfDestructingSolverStorable10 [2023-08-31 02:57:30,968 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-31 02:57:30,968 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:57:30,968 INFO L85 PathProgramCache]: Analyzing trace with hash -308222025, now seen corresponding path program 2 times [2023-08-31 02:57:30,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:57:30,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822834747] [2023-08-31 02:57:30,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:57:30,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:57:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:57:31,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-31 02:57:31,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:57:31,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822834747] [2023-08-31 02:57:31,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822834747] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:57:31,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097619482] [2023-08-31 02:57:31,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 02:57:31,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:57:31,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:57:31,179 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-31 02:57:31,181 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-31 02:57:31,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 02:57:31,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 02:57:31,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 02:57:31,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:57:31,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-31 02:57:31,391 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 02:57:31,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097619482] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:57:31,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-31 02:57:31,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2023-08-31 02:57:31,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546051877] [2023-08-31 02:57:31,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:57:31,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 02:57:31,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:57:31,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 02:57:31,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-31 02:57:31,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 489 [2023-08-31 02:57:31,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 119 transitions, 1130 flow. Second operand has 5 states, 5 states have (on average 222.6) internal successors, (1113), 5 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:31,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:57:31,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 489 [2023-08-31 02:57:31,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:57:34,308 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), 109#L57true, Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 68#L119true, 228#L148-4true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 8#L86true, Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 565#true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 197#L104true, Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 506#(< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:34,308 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-31 02:57:34,309 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-31 02:57:34,309 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-31 02:57:34,309 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-31 02:57:34,824 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), 109#L57true, Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 103#L149-1true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 565#true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 197#L104true, Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 506#(< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:34,824 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-31 02:57:34,824 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-31 02:57:34,824 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-31 02:57:34,824 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-31 02:57:35,330 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 81#L63true, 208#L101true, Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 103#L149-1true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 565#true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,330 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-31 02:57:35,331 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-31 02:57:35,331 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-31 02:57:35,331 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-31 02:57:35,375 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 101#L80true, 68#L119true, Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 565#true, Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 197#L104true, Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 293#(= ~j~0 0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 115#L150-1true, Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,375 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-31 02:57:35,376 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-31 02:57:35,376 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-31 02:57:35,376 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-31 02:57:35,394 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 98#L149-2true, 68#L119true, Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), 565#true, Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 197#L104true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 293#(= ~j~0 0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,395 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-31 02:57:35,395 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-31 02:57:35,395 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-31 02:57:35,395 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-31 02:57:35,402 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 81#L63true, Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 103#L149-1true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), 565#true, Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 197#L104true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 293#(= ~j~0 0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,403 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-31 02:57:35,403 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-31 02:57:35,403 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-31 02:57:35,403 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-31 02:57:35,405 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 81#L63true, Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 68#L119true, 228#L148-4true, Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), 565#true, Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 122#thread3EXITtrue, 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 293#(= ~j~0 0), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 249#(= ~total~0 0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,406 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-31 02:57:35,406 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-31 02:57:35,406 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-31 02:57:35,406 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-31 02:57:35,428 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 208#L101true, Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 103#L149-1true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 565#true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 552#(<= ~q2_front~0 ~q2_back~0), 27#thread1EXITtrue, Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,428 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-31 02:57:35,428 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-31 02:57:35,428 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-31 02:57:35,428 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-31 02:57:35,431 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 101#L80true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 565#true, 197#L104true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 115#L150-1true, Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,432 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-31 02:57:35,432 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-31 02:57:35,432 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-31 02:57:35,432 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-31 02:57:35,432 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 98#L149-2true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 565#true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 197#L104true, Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,433 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-31 02:57:35,433 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-31 02:57:35,433 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-31 02:57:35,433 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-31 02:57:35,446 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 39#thread2EXITtrue, 98#L149-2true, 68#L119true, Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), 565#true, Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 197#L104true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 293#(= ~j~0 0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,447 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-31 02:57:35,447 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-31 02:57:35,447 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-31 02:57:35,447 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-31 02:57:35,463 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 68#L119true, Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 565#true, Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 197#L104true, Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 115#L150-1true, Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,463 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-31 02:57:35,463 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-31 02:57:35,463 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-31 02:57:35,464 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-31 02:57:35,464 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 101#L80true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 565#true, Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 122#thread3EXITtrue, Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), 115#L150-1true, Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,465 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-31 02:57:35,465 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-31 02:57:35,465 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-31 02:57:35,465 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-31 02:57:35,467 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 103#L149-1true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), 565#true, Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 197#L104true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 293#(= ~j~0 0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 552#(<= ~q2_front~0 ~q2_back~0), 27#thread1EXITtrue, Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,467 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-31 02:57:35,467 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-31 02:57:35,467 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-31 02:57:35,467 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-31 02:57:35,472 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 228#L148-4true, 68#L119true, Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), 565#true, Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 122#thread3EXITtrue, 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 293#(= ~j~0 0), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), 27#thread1EXITtrue, Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 249#(= ~total~0 0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,472 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-31 02:57:35,473 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-31 02:57:35,473 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-31 02:57:35,473 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-31 02:57:35,478 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 98#L149-2true, 68#L119true, Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), 565#true, Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 122#thread3EXITtrue, Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 293#(= ~j~0 0), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,478 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-31 02:57:35,478 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-31 02:57:35,478 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-31 02:57:35,479 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-31 02:57:35,482 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 81#L63true, Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 103#L149-1true, 68#L119true, Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), 565#true, Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 122#thread3EXITtrue, 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,482 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-31 02:57:35,482 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-31 02:57:35,482 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-31 02:57:35,482 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-31 02:57:35,489 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 39#thread2EXITtrue, 98#L149-2true, 68#L119true, Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 565#true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 197#L104true, Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,489 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-31 02:57:35,489 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-31 02:57:35,490 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-31 02:57:35,490 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-31 02:57:35,496 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 208#L101true, Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 98#L149-2true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 565#true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,496 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-31 02:57:35,496 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-31 02:57:35,497 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-31 02:57:35,497 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-31 02:57:35,499 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 565#true, 197#L104true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 115#L150-1true, Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), 828#(<= ~q1_front~0 ~q1_back~0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,499 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-31 02:57:35,499 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-31 02:57:35,499 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-31 02:57:35,499 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-31 02:57:35,504 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 39#thread2EXITtrue, 68#L119true, Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 565#true, Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 197#L104true, Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 115#L150-1true, Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,504 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-31 02:57:35,504 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-31 02:57:35,504 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-31 02:57:35,505 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-31 02:57:35,512 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 39#thread2EXITtrue, 98#L149-2true, 68#L119true, Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), 565#true, Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 122#thread3EXITtrue, Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 293#(= ~j~0 0), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,513 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-31 02:57:35,513 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-31 02:57:35,513 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-31 02:57:35,513 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-31 02:57:35,522 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 565#true, Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 122#thread3EXITtrue, Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), 115#L150-1true, Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,522 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-31 02:57:35,522 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-31 02:57:35,523 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-31 02:57:35,523 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-31 02:57:35,524 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 103#L149-1true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 8#L86true, Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), 565#true, Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 122#thread3EXITtrue, 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 27#thread1EXITtrue, Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,524 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-31 02:57:35,524 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-31 02:57:35,524 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-31 02:57:35,524 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-31 02:57:35,525 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 98#L149-2true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), 565#true, Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 197#L104true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 293#(= ~j~0 0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,525 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-31 02:57:35,526 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-31 02:57:35,526 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-31 02:57:35,526 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-31 02:57:35,536 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 39#thread2EXITtrue, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 565#true, 197#L104true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 115#L150-1true, Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,537 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-31 02:57:35,537 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-31 02:57:35,537 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-31 02:57:35,537 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-31 02:57:35,540 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 208#L101true, Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 565#true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), 115#L150-1true, Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 249#(= ~total~0 0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,540 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-31 02:57:35,540 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-31 02:57:35,540 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-31 02:57:35,540 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-31 02:57:35,544 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 39#thread2EXITtrue, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 565#true, Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 122#thread3EXITtrue, Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), 115#L150-1true, Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,544 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-31 02:57:35,545 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-31 02:57:35,545 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-31 02:57:35,545 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-31 02:57:35,546 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 68#L119true, Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 565#true, Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 70#L150-2true, Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 197#L104true, Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 828#(<= ~q1_front~0 ~q1_back~0), Black: 249#(= ~total~0 0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,546 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-31 02:57:35,546 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-31 02:57:35,546 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-31 02:57:35,546 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-31 02:57:35,556 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 98#L149-2true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 8#L86true, Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), 565#true, Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 122#thread3EXITtrue, 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,557 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-31 02:57:35,557 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-31 02:57:35,557 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-31 02:57:35,557 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-31 02:57:35,558 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), 565#true, Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 197#L104true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 293#(= ~j~0 0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), 115#L150-1true, Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,558 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-31 02:57:35,558 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-31 02:57:35,558 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-31 02:57:35,559 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-31 02:57:35,566 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 70#L150-2true, Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 565#true, 197#L104true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,566 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-31 02:57:35,566 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-31 02:57:35,566 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-31 02:57:35,566 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-31 02:57:35,571 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 565#true, Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 122#thread3EXITtrue, 70#L150-2true, Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,571 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-31 02:57:35,572 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-31 02:57:35,572 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-31 02:57:35,572 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-31 02:57:35,573 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 138#L151-1true, 68#L119true, Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 565#true, Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 197#L104true, Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,573 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-31 02:57:35,573 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-31 02:57:35,573 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-31 02:57:35,573 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-31 02:57:35,579 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 8#L86true, Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), 565#true, Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 122#thread3EXITtrue, 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), 115#L150-1true, Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,580 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-31 02:57:35,580 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-31 02:57:35,580 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-31 02:57:35,580 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-31 02:57:35,582 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 138#L151-1true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 565#true, 197#L104true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,582 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-31 02:57:35,583 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-31 02:57:35,583 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-31 02:57:35,583 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-31 02:57:35,586 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 138#L151-1true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 565#true, Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 122#thread3EXITtrue, Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,586 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-31 02:57:35,587 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-31 02:57:35,587 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-31 02:57:35,587 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-31 02:57:35,595 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), 133#L151-2true, Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 565#true, Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,595 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-31 02:57:35,595 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-31 02:57:35,595 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-31 02:57:35,595 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-31 02:57:35,599 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 61#L152-1true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 565#true, Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-08-31 02:57:35,599 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-31 02:57:35,599 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-31 02:57:35,599 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-31 02:57:35,599 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-31 02:57:35,601 INFO L130 PetriNetUnfolder]: 24670/33330 cut-off events. [2023-08-31 02:57:35,601 INFO L131 PetriNetUnfolder]: For 219217/221379 co-relation queries the response was YES. [2023-08-31 02:57:35,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155998 conditions, 33330 events. 24670/33330 cut-off events. For 219217/221379 co-relation queries the response was YES. Maximal size of possible extension queue 1161. Compared 187101 event pairs, 3539 based on Foata normal form. 2259/35082 useless extension candidates. Maximal degree in co-relation 155949. Up to 11407 conditions per place. [2023-08-31 02:57:35,924 INFO L137 encePairwiseOnDemand]: 483/489 looper letters, 270 selfloop transitions, 24 changer transitions 0/306 dead transitions. [2023-08-31 02:57:35,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 306 transitions, 3608 flow [2023-08-31 02:57:35,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 02:57:35,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 02:57:35,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1392 transitions. [2023-08-31 02:57:35,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47443762781186094 [2023-08-31 02:57:35,929 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1392 transitions. [2023-08-31 02:57:35,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1392 transitions. [2023-08-31 02:57:35,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:57:35,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1392 transitions. [2023-08-31 02:57:35,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:35,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 489.0) internal successors, (3423), 7 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:35,941 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 489.0) internal successors, (3423), 7 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:35,941 INFO L175 Difference]: Start difference. First operand has 96 places, 119 transitions, 1130 flow. Second operand 6 states and 1392 transitions. [2023-08-31 02:57:35,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 306 transitions, 3608 flow [2023-08-31 02:57:36,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 306 transitions, 3604 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 02:57:36,280 INFO L231 Difference]: Finished difference. Result has 103 places, 137 transitions, 1391 flow [2023-08-31 02:57:36,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1391, PETRI_PLACES=103, PETRI_TRANSITIONS=137} [2023-08-31 02:57:36,281 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 58 predicate places. [2023-08-31 02:57:36,281 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 137 transitions, 1391 flow [2023-08-31 02:57:36,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 222.6) internal successors, (1113), 5 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:57:36,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:57:36,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 02:57:36,293 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-31 02:57:36,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:57:36,488 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-31 02:57:36,488 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:57:36,488 INFO L85 PathProgramCache]: Analyzing trace with hash 48592162, now seen corresponding path program 1 times [2023-08-31 02:57:36,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:57:36,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356541156] [2023-08-31 02:57:36,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:57:36,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:57:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:57:40,299 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:57:40,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:57:40,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356541156] [2023-08-31 02:57:40,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356541156] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:57:40,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225648400] [2023-08-31 02:57:40,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:57:40,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:57:40,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:57:40,301 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-31 02:57:40,304 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-31 02:57:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:57:40,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 89 conjunts are in the unsatisfiable core [2023-08-31 02:57:40,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:57:40,588 INFO L321 Elim1Store]: treesize reduction 141, result has 23.8 percent of original size [2023-08-31 02:57:40,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 18 treesize of output 49 [2023-08-31 02:57:40,839 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-31 02:57:40,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-08-31 02:57:41,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 02:57:41,665 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-31 02:57:41,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 27 [2023-08-31 02:57:41,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 02:57:41,869 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-31 02:57:41,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 27 [2023-08-31 02:57:42,454 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 02:57:42,455 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 02:57:42,467 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-08-31 02:57:42,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 30 [2023-08-31 02:57:42,500 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:57:42,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:57:44,200 INFO L321 Elim1Store]: treesize reduction 22, result has 95.1 percent of original size [2023-08-31 02:57:44,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 2704 treesize of output 2732 [2023-08-31 02:57:44,564 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:57:44,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1513 treesize of output 1410 [2023-08-31 02:57:44,702 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:57:44,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1321 treesize of output 1314 [2023-08-31 02:57:44,849 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:57:44,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1225 treesize of output 1218 [2023-08-31 02:57:45,010 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:57:45,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1129 treesize of output 1026 [2023-08-31 03:08:26,254 WARN L222 SmtUtils]: Spent 7.87s on a formula simplification. DAG size of input: 1118 DAG size of output: 1155 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Killed by 15