./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f Calling Ultimate with: /root/.sdkman/candidates/java/current/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-bad-buffer-mult-alt2.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 --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 a79fe9fcfc95192d454ac05616e4d9a71dbf2bcc8b4fd9d21dcef47910a50542 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 15:34:03,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 15:34:03,063 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 15:34:03,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 15:34:03,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 15:34:03,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 15:34:03,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 15:34:03,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 15:34:03,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 15:34:03,095 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 15:34:03,095 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 15:34:03,096 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 15:34:03,096 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 15:34:03,097 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 15:34:03,098 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 15:34:03,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 15:34:03,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 15:34:03,098 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 15:34:03,099 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 15:34:03,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 15:34:03,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 15:34:03,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 15:34:03,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 15:34:03,100 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 15:34:03,100 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 15:34:03,100 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 15:34:03,101 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 15:34:03,101 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 15:34:03,101 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 15:34:03,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 15:34:03,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 15:34:03,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 15:34:03,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:34:03,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 15:34:03,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 15:34:03,103 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 15:34:03,104 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 15:34:03,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 15:34:03,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 15:34:03,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 15:34:03,104 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 15:34:03,105 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 15:34:03,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 15:34:03,105 INFO L153 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 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 -> a79fe9fcfc95192d454ac05616e4d9a71dbf2bcc8b4fd9d21dcef47910a50542 [2024-01-27 15:34:03,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 15:34:03,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 15:34:03,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 15:34:03,342 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 15:34:03,342 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 15:34:03,343 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2024-01-27 15:34:04,429 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 15:34:04,612 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 15:34:04,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2024-01-27 15:34:04,619 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8367dccb/27bd5e190c1042d1b2ef012e962b08e3/FLAGfed2612cb [2024-01-27 15:34:04,631 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8367dccb/27bd5e190c1042d1b2ef012e962b08e3 [2024-01-27 15:34:04,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 15:34:04,635 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 15:34:04,636 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 15:34:04,636 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 15:34:04,640 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 15:34:04,641 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:34:04" (1/1) ... [2024-01-27 15:34:04,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@334135ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:34:04, skipping insertion in model container [2024-01-27 15:34:04,642 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:34:04" (1/1) ... [2024-01-27 15:34:04,674 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:34:04,821 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c[4226,4239] [2024-01-27 15:34:04,829 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:34:04,836 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 15:34:04,855 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c[4226,4239] [2024-01-27 15:34:04,862 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:34:04,881 INFO L206 MainTranslator]: Completed translation [2024-01-27 15:34:04,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:34:04 WrapperNode [2024-01-27 15:34:04,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 15:34:04,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 15:34:04,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 15:34:04,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 15:34:04,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:34:04" (1/1) ... [2024-01-27 15:34:04,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:34:04" (1/1) ... [2024-01-27 15:34:04,943 INFO L138 Inliner]: procedures = 26, calls = 75, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 331 [2024-01-27 15:34:04,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 15:34:04,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 15:34:04,944 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 15:34:04,944 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 15:34:04,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:34:04" (1/1) ... [2024-01-27 15:34:04,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:34:04" (1/1) ... [2024-01-27 15:34:04,959 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:34:04" (1/1) ... [2024-01-27 15:34:04,980 INFO L175 MemorySlicer]: Split 16 memory accesses to 6 slices as follows [2, 6, 2, 2, 2, 2]. 38 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 6 writes are split as follows [0, 2, 1, 1, 1, 1]. [2024-01-27 15:34:04,980 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:34:04" (1/1) ... [2024-01-27 15:34:04,980 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:34:04" (1/1) ... [2024-01-27 15:34:04,988 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:34:04" (1/1) ... [2024-01-27 15:34:04,992 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:34:04" (1/1) ... [2024-01-27 15:34:04,994 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:34:04" (1/1) ... [2024-01-27 15:34:04,996 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:34:04" (1/1) ... [2024-01-27 15:34:04,998 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 15:34:04,999 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 15:34:04,999 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 15:34:04,999 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 15:34:05,000 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:34:04" (1/1) ... [2024-01-27 15:34:05,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:34:05,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:34:05,046 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-27 15:34:05,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-27 15:34:05,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 15:34:05,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 15:34:05,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 15:34:05,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 15:34:05,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 15:34:05,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 15:34:05,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 15:34:05,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-01-27 15:34:05,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 15:34:05,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 15:34:05,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 15:34:05,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 15:34:05,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 15:34:05,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-01-27 15:34:05,091 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 15:34:05,091 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 15:34:05,091 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 15:34:05,091 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 15:34:05,091 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-27 15:34:05,092 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-27 15:34:05,092 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-01-27 15:34:05,092 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-01-27 15:34:05,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 15:34:05,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 15:34:05,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 15:34:05,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 15:34:05,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 15:34:05,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-01-27 15:34:05,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 15:34:05,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 15:34:05,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-27 15:34:05,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 15:34:05,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 15:34:05,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 15:34:05,096 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 15:34:05,211 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 15:34:05,213 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 15:34:05,585 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 15:34:05,585 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 15:34:06,009 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 15:34:06,009 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-01-27 15:34:06,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:34:06 BoogieIcfgContainer [2024-01-27 15:34:06,010 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 15:34:06,011 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 15:34:06,011 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 15:34:06,014 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 15:34:06,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 03:34:04" (1/3) ... [2024-01-27 15:34:06,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10984b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:34:06, skipping insertion in model container [2024-01-27 15:34:06,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:34:04" (2/3) ... [2024-01-27 15:34:06,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10984b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:34:06, skipping insertion in model container [2024-01-27 15:34:06,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:34:06" (3/3) ... [2024-01-27 15:34:06,017 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2024-01-27 15:34:06,025 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 15:34:06,032 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 15:34:06,032 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 15:34:06,032 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 15:34:06,084 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-01-27 15:34:06,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 51 transitions, 130 flow [2024-01-27 15:34:06,154 INFO L124 PetriNetUnfolderBase]: 6/47 cut-off events. [2024-01-27 15:34:06,155 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-27 15:34:06,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 47 events. 6/47 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 76 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-01-27 15:34:06,158 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 51 transitions, 130 flow [2024-01-27 15:34:06,161 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 46 transitions, 116 flow [2024-01-27 15:34:06,173 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:34:06,179 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=LoopHeads, 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;@72f25daf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:34:06,179 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-01-27 15:34:06,192 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:34:06,192 INFO L124 PetriNetUnfolderBase]: 6/45 cut-off events. [2024-01-27 15:34:06,193 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-27 15:34:06,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:34:06,193 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] [2024-01-27 15:34:06,194 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)] === [2024-01-27 15:34:06,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:34:06,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1259852029, now seen corresponding path program 1 times [2024-01-27 15:34:06,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:34:06,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226100073] [2024-01-27 15:34:06,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:34:06,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:34:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:34:06,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:34:06,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:34:06,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226100073] [2024-01-27 15:34:06,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226100073] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:34:06,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:34:06,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:34:06,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384530488] [2024-01-27 15:34:06,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:34:06,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:34:06,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:34:06,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:34:06,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:34:06,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 51 [2024-01-27 15:34:06,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:34:06,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:34:06,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 51 [2024-01-27 15:34:06,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:34:07,536 INFO L124 PetriNetUnfolderBase]: 2083/3088 cut-off events. [2024-01-27 15:34:07,536 INFO L125 PetriNetUnfolderBase]: For 264/264 co-relation queries the response was YES. [2024-01-27 15:34:07,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6138 conditions, 3088 events. 2083/3088 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 17521 event pairs, 251 based on Foata normal form. 144/3190 useless extension candidates. Maximal degree in co-relation 4745. Up to 1594 conditions per place. [2024-01-27 15:34:07,563 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 71 selfloop transitions, 7 changer transitions 0/93 dead transitions. [2024-01-27 15:34:07,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 93 transitions, 399 flow [2024-01-27 15:34:07,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:34:07,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:34:07,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2024-01-27 15:34:07,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6339869281045751 [2024-01-27 15:34:07,576 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 116 flow. Second operand 6 states and 194 transitions. [2024-01-27 15:34:07,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 93 transitions, 399 flow [2024-01-27 15:34:07,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 93 transitions, 361 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-01-27 15:34:07,588 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 147 flow [2024-01-27 15:34:07,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=147, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2024-01-27 15:34:07,592 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2024-01-27 15:34:07,592 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 147 flow [2024-01-27 15:34:07,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:34:07,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:34:07,593 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] [2024-01-27 15:34:07,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 15:34:07,594 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)] === [2024-01-27 15:34:07,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:34:07,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1263929748, now seen corresponding path program 1 times [2024-01-27 15:34:07,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:34:07,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863347081] [2024-01-27 15:34:07,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:34:07,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:34:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:34:07,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:34:07,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:34:07,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863347081] [2024-01-27 15:34:07,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863347081] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:34:07,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:34:07,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:34:07,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373501010] [2024-01-27 15:34:07,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:34:07,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:34:07,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:34:07,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:34:07,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:34:07,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 51 [2024-01-27 15:34:07,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:34:07,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:34:07,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 51 [2024-01-27 15:34:07,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:34:08,348 INFO L124 PetriNetUnfolderBase]: 3239/5036 cut-off events. [2024-01-27 15:34:08,349 INFO L125 PetriNetUnfolderBase]: For 2544/2544 co-relation queries the response was YES. [2024-01-27 15:34:08,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12203 conditions, 5036 events. 3239/5036 cut-off events. For 2544/2544 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 33616 event pairs, 1093 based on Foata normal form. 72/4989 useless extension candidates. Maximal degree in co-relation 3658. Up to 2030 conditions per place. [2024-01-27 15:34:08,383 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 79 selfloop transitions, 11 changer transitions 0/105 dead transitions. [2024-01-27 15:34:08,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 105 transitions, 477 flow [2024-01-27 15:34:08,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:34:08,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:34:08,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 200 transitions. [2024-01-27 15:34:08,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6535947712418301 [2024-01-27 15:34:08,385 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 147 flow. Second operand 6 states and 200 transitions. [2024-01-27 15:34:08,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 105 transitions, 477 flow [2024-01-27 15:34:08,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 105 transitions, 471 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 15:34:08,390 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 231 flow [2024-01-27 15:34:08,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=60, PETRI_TRANSITIONS=58} [2024-01-27 15:34:08,390 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2024-01-27 15:34:08,391 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 231 flow [2024-01-27 15:34:08,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:34:08,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:34:08,391 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] [2024-01-27 15:34:08,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 15:34:08,392 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)] === [2024-01-27 15:34:08,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:34:08,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1916060414, now seen corresponding path program 1 times [2024-01-27 15:34:08,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:34:08,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271689847] [2024-01-27 15:34:08,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:34:08,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:34:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:34:08,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:34:08,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:34:08,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271689847] [2024-01-27 15:34:08,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271689847] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:34:08,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:34:08,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:34:08,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784153228] [2024-01-27 15:34:08,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:34:08,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:34:08,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:34:08,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:34:08,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:34:08,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2024-01-27 15:34:08,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:34:08,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:34:08,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2024-01-27 15:34:08,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:34:08,832 INFO L124 PetriNetUnfolderBase]: 2155/3565 cut-off events. [2024-01-27 15:34:08,832 INFO L125 PetriNetUnfolderBase]: For 6029/6305 co-relation queries the response was YES. [2024-01-27 15:34:08,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10084 conditions, 3565 events. 2155/3565 cut-off events. For 6029/6305 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 24305 event pairs, 371 based on Foata normal form. 210/3650 useless extension candidates. Maximal degree in co-relation 3682. Up to 2747 conditions per place. [2024-01-27 15:34:08,859 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 44 selfloop transitions, 3 changer transitions 4/73 dead transitions. [2024-01-27 15:34:08,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 73 transitions, 364 flow [2024-01-27 15:34:08,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:34:08,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:34:08,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2024-01-27 15:34:08,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7189542483660131 [2024-01-27 15:34:08,862 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 231 flow. Second operand 3 states and 110 transitions. [2024-01-27 15:34:08,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 73 transitions, 364 flow [2024-01-27 15:34:08,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 73 transitions, 357 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-01-27 15:34:08,869 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 224 flow [2024-01-27 15:34:08,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2024-01-27 15:34:08,870 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2024-01-27 15:34:08,871 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 224 flow [2024-01-27 15:34:08,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:34:08,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:34:08,871 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] [2024-01-27 15:34:08,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 15:34:08,871 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)] === [2024-01-27 15:34:08,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:34:08,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1574095419, now seen corresponding path program 1 times [2024-01-27 15:34:08,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:34:08,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713471313] [2024-01-27 15:34:08,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:34:08,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:34:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:34:09,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:34:09,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:34:09,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713471313] [2024-01-27 15:34:09,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713471313] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:34:09,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:34:09,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:34:09,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443398071] [2024-01-27 15:34:09,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:34:09,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:34:09,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:34:09,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:34:09,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:34:09,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2024-01-27 15:34:09,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:34:09,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:34:09,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2024-01-27 15:34:09,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:34:09,456 INFO L124 PetriNetUnfolderBase]: 2506/4080 cut-off events. [2024-01-27 15:34:09,456 INFO L125 PetriNetUnfolderBase]: For 8577/8967 co-relation queries the response was YES. [2024-01-27 15:34:09,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11424 conditions, 4080 events. 2506/4080 cut-off events. For 8577/8967 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 28065 event pairs, 1868 based on Foata normal form. 429/4226 useless extension candidates. Maximal degree in co-relation 7228. Up to 3236 conditions per place. [2024-01-27 15:34:09,484 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 34 selfloop transitions, 2 changer transitions 20/78 dead transitions. [2024-01-27 15:34:09,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 78 transitions, 390 flow [2024-01-27 15:34:09,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:34:09,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:34:09,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2024-01-27 15:34:09,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6617647058823529 [2024-01-27 15:34:09,487 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 224 flow. Second operand 4 states and 135 transitions. [2024-01-27 15:34:09,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 78 transitions, 390 flow [2024-01-27 15:34:09,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 78 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 15:34:09,493 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 234 flow [2024-01-27 15:34:09,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2024-01-27 15:34:09,495 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2024-01-27 15:34:09,495 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 234 flow [2024-01-27 15:34:09,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:34:09,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:34:09,495 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] [2024-01-27 15:34:09,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 15:34:09,496 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)] === [2024-01-27 15:34:09,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:34:09,496 INFO L85 PathProgramCache]: Analyzing trace with hash 259808718, now seen corresponding path program 1 times [2024-01-27 15:34:09,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:34:09,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749174870] [2024-01-27 15:34:09,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:34:09,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:34:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:34:10,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:34:10,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:34:10,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749174870] [2024-01-27 15:34:10,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749174870] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:34:10,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597206210] [2024-01-27 15:34:10,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:34:10,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:34:10,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:34:10,141 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) [2024-01-27 15:34:10,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-01-27 15:34:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:34:10,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 20 conjunts are in the unsatisfiable core [2024-01-27 15:34:10,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:34:10,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 23 treesize of output 1 [2024-01-27 15:34:10,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-01-27 15:34:10,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:34:10,553 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:34:10,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2024-01-27 15:34:10,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2024-01-27 15:34:10,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:34:10,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597206210] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:34:10,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:34:10,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-01-27 15:34:10,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475884715] [2024-01-27 15:34:10,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:34:10,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-01-27 15:34:10,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:34:10,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-01-27 15:34:10,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-01-27 15:34:10,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2024-01-27 15:34:10,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 234 flow. Second operand has 18 states, 18 states have (on average 23.88888888888889) internal successors, (430), 18 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:34:10,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:34:10,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2024-01-27 15:34:10,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:34:12,732 INFO L124 PetriNetUnfolderBase]: 6514/10470 cut-off events. [2024-01-27 15:34:12,732 INFO L125 PetriNetUnfolderBase]: For 18384/19142 co-relation queries the response was YES. [2024-01-27 15:34:12,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29251 conditions, 10470 events. 6514/10470 cut-off events. For 18384/19142 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 77957 event pairs, 1412 based on Foata normal form. 583/10532 useless extension candidates. Maximal degree in co-relation 29232. Up to 4229 conditions per place. [2024-01-27 15:34:12,800 INFO L140 encePairwiseOnDemand]: 42/51 looper letters, 157 selfloop transitions, 37 changer transitions 14/230 dead transitions. [2024-01-27 15:34:12,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 230 transitions, 1263 flow [2024-01-27 15:34:12,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-01-27 15:34:12,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-01-27 15:34:12,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 526 transitions. [2024-01-27 15:34:12,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6446078431372549 [2024-01-27 15:34:12,802 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 234 flow. Second operand 16 states and 526 transitions. [2024-01-27 15:34:12,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 230 transitions, 1263 flow [2024-01-27 15:34:12,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 230 transitions, 1243 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-01-27 15:34:12,822 INFO L231 Difference]: Finished difference. Result has 80 places, 96 transitions, 560 flow [2024-01-27 15:34:12,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=560, PETRI_PLACES=80, PETRI_TRANSITIONS=96} [2024-01-27 15:34:12,823 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 27 predicate places. [2024-01-27 15:34:12,823 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 96 transitions, 560 flow [2024-01-27 15:34:12,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 23.88888888888889) internal successors, (430), 18 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:34:12,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:34:12,824 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:34:12,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-01-27 15:34:13,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:34:13,035 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)] === [2024-01-27 15:34:13,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:34:13,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1160608728, now seen corresponding path program 1 times [2024-01-27 15:34:13,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:34:13,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275796426] [2024-01-27 15:34:13,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:34:13,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:34:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:34:13,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:34:13,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:34:13,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275796426] [2024-01-27 15:34:13,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275796426] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:34:13,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536678949] [2024-01-27 15:34:13,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:34:13,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:34:13,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:34:13,847 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) [2024-01-27 15:34:13,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-01-27 15:34:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:34:13,981 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 13 conjunts are in the unsatisfiable core [2024-01-27 15:34:13,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:34:14,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2024-01-27 15:34:14,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:34:14,096 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:34:14,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:34:14,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2024-01-27 15:34:14,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:34:14,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536678949] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:34:14,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:34:14,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 5] total 15 [2024-01-27 15:34:14,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180768172] [2024-01-27 15:34:14,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:34:14,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-01-27 15:34:14,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:34:14,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-01-27 15:34:14,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-01-27 15:34:14,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2024-01-27 15:34:14,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 96 transitions, 560 flow. Second operand has 16 states, 16 states have (on average 24.375) internal successors, (390), 16 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:34:14,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:34:14,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2024-01-27 15:34:14,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:34:16,186 INFO L124 PetriNetUnfolderBase]: 8714/14248 cut-off events. [2024-01-27 15:34:16,186 INFO L125 PetriNetUnfolderBase]: For 32156/33345 co-relation queries the response was YES. [2024-01-27 15:34:16,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43140 conditions, 14248 events. 8714/14248 cut-off events. For 32156/33345 co-relation queries the response was YES. Maximal size of possible extension queue 872. Compared 111573 event pairs, 819 based on Foata normal form. 767/14471 useless extension candidates. Maximal degree in co-relation 32329. Up to 5331 conditions per place. [2024-01-27 15:34:16,328 INFO L140 encePairwiseOnDemand]: 42/51 looper letters, 107 selfloop transitions, 63 changer transitions 9/201 dead transitions. [2024-01-27 15:34:16,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 201 transitions, 1351 flow [2024-01-27 15:34:16,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-01-27 15:34:16,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-01-27 15:34:16,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 466 transitions. [2024-01-27 15:34:16,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.571078431372549 [2024-01-27 15:34:16,331 INFO L175 Difference]: Start difference. First operand has 80 places, 96 transitions, 560 flow. Second operand 16 states and 466 transitions. [2024-01-27 15:34:16,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 201 transitions, 1351 flow [2024-01-27 15:34:16,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 201 transitions, 1331 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-01-27 15:34:16,370 INFO L231 Difference]: Finished difference. Result has 96 places, 123 transitions, 926 flow [2024-01-27 15:34:16,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=926, PETRI_PLACES=96, PETRI_TRANSITIONS=123} [2024-01-27 15:34:16,371 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 43 predicate places. [2024-01-27 15:34:16,371 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 123 transitions, 926 flow [2024-01-27 15:34:16,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 24.375) internal successors, (390), 16 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:34:16,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:34:16,372 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, 1, 1, 1] [2024-01-27 15:34:16,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-01-27 15:34:16,584 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,SelfDestructingSolverStorable5 [2024-01-27 15:34:16,584 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)] === [2024-01-27 15:34:16,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:34:16,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1532036085, now seen corresponding path program 1 times [2024-01-27 15:34:16,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:34:16,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808827403] [2024-01-27 15:34:16,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:34:16,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:34:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:34:16,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:34:16,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:34:16,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808827403] [2024-01-27 15:34:16,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808827403] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:34:16,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:34:16,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:34:16,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786813277] [2024-01-27 15:34:16,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:34:16,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:34:16,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:34:16,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:34:16,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:34:16,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2024-01-27 15:34:16,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 123 transitions, 926 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:34:16,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:34:16,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2024-01-27 15:34:16,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:34:18,056 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 20#L92true, Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 16#L56true, 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 100#(<= 1 ~total~0), Black: 360#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 342#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 10#L143-4true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), 365#true, Black: 73#(<= ~q1_front~0 ~q1_back~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 4#L110true, 637#true, 13#L74true, Black: 378#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 374#(<= 1 ~total~0)]) [2024-01-27 15:34:18,057 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-01-27 15:34:18,057 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:34:18,057 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-27 15:34:18,058 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-27 15:34:18,092 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 20#L92true, 2#thread4EXITtrue, Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 16#L56true, 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 100#(<= 1 ~total~0), Black: 360#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 342#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 10#L143-4true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), 365#true, Black: 73#(<= ~q1_front~0 ~q1_back~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 637#true, 13#L74true, Black: 378#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 374#(<= 1 ~total~0)]) [2024-01-27 15:34:18,093 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-01-27 15:34:18,093 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:34:18,093 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 15:34:18,093 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-27 15:34:18,150 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [30#L144-1true, 20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 16#L56true, 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 100#(<= 1 ~total~0), Black: 360#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 342#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), 365#true, 4#L110true, Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 637#true, 13#L74true, Black: 378#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 93#true, Black: 374#(<= 1 ~total~0), Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-27 15:34:18,151 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-01-27 15:34:18,151 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-27 15:34:18,151 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:34:18,151 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-27 15:34:18,186 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [30#L144-1true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 20#L92true, Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 2#thread4EXITtrue, Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 16#L56true, 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 100#(<= 1 ~total~0), Black: 360#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 342#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), 365#true, Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 637#true, 13#L74true, 93#true, Black: 378#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 374#(<= 1 ~total~0)]) [2024-01-27 15:34:18,186 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-01-27 15:34:18,186 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-27 15:34:18,187 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:34:18,187 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:34:18,385 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 20#L92true, Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 100#(<= 1 ~total~0), Black: 360#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 342#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 10#L143-4true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), 365#true, Black: 73#(<= ~q1_front~0 ~q1_back~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 4#L110true, 637#true, 13#L74true, 11#thread1EXITtrue, Black: 378#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 374#(<= 1 ~total~0)]) [2024-01-27 15:34:18,386 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-01-27 15:34:18,386 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:34:18,386 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 15:34:18,386 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-27 15:34:18,399 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 20#L92true, 37#thread2EXITtrue, Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 16#L56true, 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 100#(<= 1 ~total~0), Black: 360#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 342#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 10#L143-4true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), 365#true, Black: 73#(<= ~q1_front~0 ~q1_back~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 4#L110true, 637#true, Black: 378#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 374#(<= 1 ~total~0)]) [2024-01-27 15:34:18,399 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-01-27 15:34:18,399 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-27 15:34:18,399 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 15:34:18,399 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:34:18,419 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 2#thread4EXITtrue, Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 100#(<= 1 ~total~0), Black: 360#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 342#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 10#L143-4true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), 365#true, Black: 73#(<= ~q1_front~0 ~q1_back~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 637#true, 11#thread1EXITtrue, 13#L74true, 93#true, Black: 378#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 374#(<= 1 ~total~0)]) [2024-01-27 15:34:18,419 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-01-27 15:34:18,419 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-27 15:34:18,419 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:34:18,420 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-27 15:34:18,429 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 37#thread2EXITtrue, 20#L92true, Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 2#thread4EXITtrue, Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 16#L56true, 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 100#(<= 1 ~total~0), Black: 360#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 342#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 10#L143-4true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), 365#true, Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 637#true, 93#true, Black: 378#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 374#(<= 1 ~total~0)]) [2024-01-27 15:34:18,429 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-01-27 15:34:18,429 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-27 15:34:18,429 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-27 15:34:18,430 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:34:18,451 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [30#L144-1true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 20#L92true, Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 100#(<= 1 ~total~0), Black: 360#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 342#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), 365#true, 4#L110true, Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 637#true, 11#thread1EXITtrue, 13#L74true, Black: 378#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 374#(<= 1 ~total~0)]) [2024-01-27 15:34:18,452 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-01-27 15:34:18,452 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-27 15:34:18,452 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:34:18,452 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:34:18,464 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [30#L144-1true, 20#L92true, 37#thread2EXITtrue, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 16#L56true, 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 100#(<= 1 ~total~0), Black: 360#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 342#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), 365#true, Black: 73#(<= ~q1_front~0 ~q1_back~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 4#L110true, 637#true, 93#true, Black: 378#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 374#(<= 1 ~total~0)]) [2024-01-27 15:34:18,465 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-01-27 15:34:18,465 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:34:18,465 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-27 15:34:18,465 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:34:18,480 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [30#L144-1true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 20#L92true, 2#thread4EXITtrue, Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 100#(<= 1 ~total~0), Black: 360#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 342#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), 365#true, Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 637#true, 13#L74true, 11#thread1EXITtrue, Black: 378#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 374#(<= 1 ~total~0)]) [2024-01-27 15:34:18,480 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-01-27 15:34:18,480 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 15:34:18,480 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-27 15:34:18,480 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:34:18,488 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [30#L144-1true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 20#L92true, 37#thread2EXITtrue, Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 2#thread4EXITtrue, Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 16#L56true, 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 100#(<= 1 ~total~0), Black: 360#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 342#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), 365#true, Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 637#true, Black: 378#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 374#(<= 1 ~total~0)]) [2024-01-27 15:34:18,489 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-01-27 15:34:18,489 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-27 15:34:18,489 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:34:18,489 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 15:34:18,507 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 100#(<= 1 ~total~0), Black: 360#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 342#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 5#L144-2true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), 365#true, Black: 73#(<= ~q1_front~0 ~q1_back~0), 4#L110true, Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 637#true, 13#L74true, Black: 378#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 93#true, Black: 374#(<= 1 ~total~0), Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-27 15:34:18,507 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-01-27 15:34:18,507 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-27 15:34:18,507 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-27 15:34:18,507 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:34:18,513 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 37#thread2EXITtrue, Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 100#(<= 1 ~total~0), Black: 360#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 342#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 10#L143-4true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), 365#true, Black: 73#(<= ~q1_front~0 ~q1_back~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 4#L110true, 637#true, 11#thread1EXITtrue, Black: 378#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 93#true, Black: 374#(<= 1 ~total~0), Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-27 15:34:18,513 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-01-27 15:34:18,513 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:34:18,513 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-27 15:34:18,513 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-27 15:34:18,526 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 20#L92true, Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 2#thread4EXITtrue, Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 100#(<= 1 ~total~0), Black: 360#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 342#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 5#L144-2true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), 365#true, Black: 73#(<= ~q1_front~0 ~q1_back~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 637#true, 13#L74true, 93#true, Black: 378#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 374#(<= 1 ~total~0)]) [2024-01-27 15:34:18,527 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-01-27 15:34:18,527 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-01-27 15:34:18,527 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:34:18,527 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:34:18,528 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 37#thread2EXITtrue, 20#L92true, 2#thread4EXITtrue, Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 100#(<= 1 ~total~0), Black: 360#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 342#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 10#L143-4true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), 365#true, Black: 73#(<= ~q1_front~0 ~q1_back~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 637#true, 11#thread1EXITtrue, Black: 378#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 374#(<= 1 ~total~0)]) [2024-01-27 15:34:18,528 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-01-27 15:34:18,529 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-01-27 15:34:18,529 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:34:18,529 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:34:18,544 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [30#L144-1true, 20#L92true, 37#thread2EXITtrue, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 100#(<= 1 ~total~0), Black: 360#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 342#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), 365#true, Black: 73#(<= ~q1_front~0 ~q1_back~0), 4#L110true, Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 637#true, 11#thread1EXITtrue, Black: 378#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 93#true, Black: 374#(<= 1 ~total~0), Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-27 15:34:18,544 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-01-27 15:34:18,545 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 15:34:18,545 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-27 15:34:18,545 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:34:18,547 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 100#(<= 1 ~total~0), Black: 360#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 342#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), 365#true, Black: 73#(<= ~q1_front~0 ~q1_back~0), 51#L145-1true, Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 4#L110true, 637#true, 13#L74true, Black: 378#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 374#(<= 1 ~total~0)]) [2024-01-27 15:34:18,547 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-01-27 15:34:18,547 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 15:34:18,547 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:34:18,547 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-27 15:34:18,560 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [30#L144-1true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 37#thread2EXITtrue, 20#L92true, 2#thread4EXITtrue, Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 100#(<= 1 ~total~0), Black: 360#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 342#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), 365#true, Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 637#true, 11#thread1EXITtrue, Black: 378#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 374#(<= 1 ~total~0)]) [2024-01-27 15:34:18,560 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-01-27 15:34:18,561 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-01-27 15:34:18,561 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-27 15:34:18,561 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:34:18,561 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 20#L92true, 2#thread4EXITtrue, Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 100#(<= 1 ~total~0), Black: 360#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 342#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), 51#L145-1true, Black: 73#(<= ~q1_front~0 ~q1_back~0), 365#true, Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 637#true, 13#L74true, 93#true, Black: 378#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 374#(<= 1 ~total~0)]) [2024-01-27 15:34:18,561 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-01-27 15:34:18,562 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-27 15:34:18,562 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:34:18,562 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-01-27 15:34:18,573 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [37#thread2EXITtrue, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 20#L92true, Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 100#(<= 1 ~total~0), Black: 360#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 342#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 5#L144-2true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), 365#true, 4#L110true, Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 637#true, Black: 378#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 93#true, Black: 374#(<= 1 ~total~0), Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-27 15:34:18,573 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-01-27 15:34:18,573 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:34:18,573 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:34:18,573 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-01-27 15:34:18,583 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 20#L92true, 37#thread2EXITtrue, 2#thread4EXITtrue, Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 100#(<= 1 ~total~0), Black: 360#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 342#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 5#L144-2true, Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), 365#true, Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 637#true, Black: 378#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 374#(<= 1 ~total~0)]) [2024-01-27 15:34:18,584 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-01-27 15:34:18,584 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-01-27 15:34:18,584 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:34:18,584 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-27 15:34:18,592 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [20#L92true, 37#thread2EXITtrue, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 100#(<= 1 ~total~0), Black: 360#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 342#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), 365#true, Black: 73#(<= ~q1_front~0 ~q1_back~0), 51#L145-1true, 4#L110true, Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 637#true, Black: 378#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 93#true, Black: 374#(<= 1 ~total~0), Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2024-01-27 15:34:18,592 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-01-27 15:34:18,592 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-27 15:34:18,593 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:34:18,593 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-01-27 15:34:18,598 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 37#thread2EXITtrue, 20#L92true, 2#thread4EXITtrue, Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 100#(<= 1 ~total~0), Black: 360#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 342#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), 51#L145-1true, Black: 73#(<= ~q1_front~0 ~q1_back~0), 365#true, Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 637#true, Black: 378#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 374#(<= 1 ~total~0)]) [2024-01-27 15:34:18,599 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-01-27 15:34:18,599 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-01-27 15:34:18,599 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-01-27 15:34:18,599 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:34:18,605 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 100#(<= 1 ~total~0), Black: 360#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 342#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), 365#true, Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 4#L110true, 637#true, 39#L145-2true, 93#true, Black: 378#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 374#(<= 1 ~total~0)]) [2024-01-27 15:34:18,605 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-01-27 15:34:18,605 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-27 15:34:18,605 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-01-27 15:34:18,605 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:34:18,609 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 20#L92true, 2#thread4EXITtrue, Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 100#(<= 1 ~total~0), Black: 360#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 342#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 73#(<= ~q1_front~0 ~q1_back~0), 365#true, Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 637#true, 39#L145-2true, 93#true, Black: 378#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 374#(<= 1 ~total~0)]) [2024-01-27 15:34:18,609 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-01-27 15:34:18,609 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-01-27 15:34:18,609 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-01-27 15:34:18,609 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-27 15:34:18,613 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [20#L92true, Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 100#(<= 1 ~total~0), Black: 360#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 342#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), 365#true, Black: 73#(<= ~q1_front~0 ~q1_back~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 4#L110true, 637#true, 93#true, Black: 378#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 19#L146-1true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 374#(<= 1 ~total~0)]) [2024-01-27 15:34:18,613 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-01-27 15:34:18,613 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-01-27 15:34:18,613 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-01-27 15:34:18,613 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:34:18,616 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (<= v_~total~0_123 2147483647) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][145], [Black: 65#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 20#L92true, Black: 67#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 2#thread4EXITtrue, Black: 64#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 79#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 334#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 100#(<= 1 ~total~0), Black: 360#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) 0) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)))), Black: 342#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= 0 ~total~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 74#(<= (+ ~q1_front~0 1) ~q1_back~0), 365#true, Black: 73#(<= ~q1_front~0 ~q1_back~0), Black: 77#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 637#true, 19#L146-1true, Black: 378#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 93#true, Black: 89#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 374#(<= 1 ~total~0)]) [2024-01-27 15:34:18,616 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-01-27 15:34:18,616 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-01-27 15:34:18,616 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-27 15:34:18,616 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-01-27 15:34:18,623 INFO L124 PetriNetUnfolderBase]: 13126/21124 cut-off events. [2024-01-27 15:34:18,623 INFO L125 PetriNetUnfolderBase]: For 88029/90337 co-relation queries the response was YES. [2024-01-27 15:34:18,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68140 conditions, 21124 events. 13126/21124 cut-off events. For 88029/90337 co-relation queries the response was YES. Maximal size of possible extension queue 1143. Compared 166607 event pairs, 3377 based on Foata normal form. 2340/22625 useless extension candidates. Maximal degree in co-relation 58838. Up to 10910 conditions per place. [2024-01-27 15:34:18,974 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 145 selfloop transitions, 10 changer transitions 0/177 dead transitions. [2024-01-27 15:34:18,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 177 transitions, 1743 flow [2024-01-27 15:34:18,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:34:18,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:34:18,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-01-27 15:34:18,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.738562091503268 [2024-01-27 15:34:18,975 INFO L175 Difference]: Start difference. First operand has 96 places, 123 transitions, 926 flow. Second operand 3 states and 113 transitions. [2024-01-27 15:34:18,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 177 transitions, 1743 flow [2024-01-27 15:34:19,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 177 transitions, 1703 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-01-27 15:34:19,030 INFO L231 Difference]: Finished difference. Result has 95 places, 124 transitions, 954 flow [2024-01-27 15:34:19,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=954, PETRI_PLACES=95, PETRI_TRANSITIONS=124} [2024-01-27 15:34:19,031 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 42 predicate places. [2024-01-27 15:34:19,031 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 124 transitions, 954 flow [2024-01-27 15:34:19,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:34:19,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:34:19,032 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:34:19,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 15:34:19,032 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)] === [2024-01-27 15:34:19,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:34:19,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1513655636, now seen corresponding path program 2 times [2024-01-27 15:34:19,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:34:19,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979633008] [2024-01-27 15:34:19,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:34:19,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:34:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:34:19,157 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:34:19,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:34:19,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979633008] [2024-01-27 15:34:19,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979633008] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:34:19,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728393127] [2024-01-27 15:34:19,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:34:19,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:34:19,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:34:19,177 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) [2024-01-27 15:34:19,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-27 15:34:19,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:34:19,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:34:19,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 4 conjunts are in the unsatisfiable core [2024-01-27 15:34:19,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:34:19,342 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:34:19,343 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:34:19,409 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:34:19,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728393127] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:34:19,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:34:19,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2024-01-27 15:34:19,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582789781] [2024-01-27 15:34:19,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:34:19,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-27 15:34:19,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:34:19,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-27 15:34:19,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-01-27 15:34:19,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2024-01-27 15:34:19,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 124 transitions, 954 flow. Second operand has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:34:19,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:34:19,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2024-01-27 15:34:19,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:34:23,336 INFO L124 PetriNetUnfolderBase]: 21388/34734 cut-off events. [2024-01-27 15:34:23,336 INFO L125 PetriNetUnfolderBase]: For 123349/125583 co-relation queries the response was YES. [2024-01-27 15:34:23,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116509 conditions, 34734 events. 21388/34734 cut-off events. For 123349/125583 co-relation queries the response was YES. Maximal size of possible extension queue 1808. Compared 300924 event pairs, 3785 based on Foata normal form. 1826/35167 useless extension candidates. Maximal degree in co-relation 109789. Up to 15032 conditions per place. [2024-01-27 15:34:23,582 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 138 selfloop transitions, 44 changer transitions 0/204 dead transitions. [2024-01-27 15:34:23,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 204 transitions, 1868 flow [2024-01-27 15:34:23,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:34:23,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:34:23,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2024-01-27 15:34:23,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7794117647058824 [2024-01-27 15:34:23,583 INFO L175 Difference]: Start difference. First operand has 95 places, 124 transitions, 954 flow. Second operand 4 states and 159 transitions. [2024-01-27 15:34:23,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 204 transitions, 1868 flow [2024-01-27 15:34:23,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 204 transitions, 1856 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:34:23,805 INFO L231 Difference]: Finished difference. Result has 99 places, 147 transitions, 1452 flow [2024-01-27 15:34:23,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1452, PETRI_PLACES=99, PETRI_TRANSITIONS=147} [2024-01-27 15:34:23,806 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 46 predicate places. [2024-01-27 15:34:23,806 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 147 transitions, 1452 flow [2024-01-27 15:34:23,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:34:23,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:34:23,806 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, 1, 1, 1, 1, 1, 1] [2024-01-27 15:34:23,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-01-27 15:34:24,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:34:24,017 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)] === [2024-01-27 15:34:24,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:34:24,017 INFO L85 PathProgramCache]: Analyzing trace with hash 2022534210, now seen corresponding path program 1 times [2024-01-27 15:34:24,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:34:24,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867656507] [2024-01-27 15:34:24,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:34:24,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:34:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:34:24,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:34:24,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:34:24,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867656507] [2024-01-27 15:34:24,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867656507] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:34:24,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:34:24,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:34:24,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066857149] [2024-01-27 15:34:24,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:34:24,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:34:24,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:34:24,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:34:24,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:34:24,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2024-01-27 15:34:24,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 147 transitions, 1452 flow. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:34:24,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:34:24,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2024-01-27 15:34:24,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:34:29,076 INFO L124 PetriNetUnfolderBase]: 25082/40926 cut-off events. [2024-01-27 15:34:29,077 INFO L125 PetriNetUnfolderBase]: For 224155/227413 co-relation queries the response was YES. [2024-01-27 15:34:29,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149614 conditions, 40926 events. 25082/40926 cut-off events. For 224155/227413 co-relation queries the response was YES. Maximal size of possible extension queue 2133. Compared 368673 event pairs, 16503 based on Foata normal form. 3708/42211 useless extension candidates. Maximal degree in co-relation 139045. Up to 23124 conditions per place. [2024-01-27 15:34:29,416 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 150 selfloop transitions, 11 changer transitions 15/198 dead transitions. [2024-01-27 15:34:29,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 198 transitions, 2360 flow [2024-01-27 15:34:29,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:34:29,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:34:29,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2024-01-27 15:34:29,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2024-01-27 15:34:29,418 INFO L175 Difference]: Start difference. First operand has 99 places, 147 transitions, 1452 flow. Second operand 4 states and 138 transitions. [2024-01-27 15:34:29,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 198 transitions, 2360 flow [2024-01-27 15:34:29,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 198 transitions, 2345 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-01-27 15:34:29,703 INFO L231 Difference]: Finished difference. Result has 102 places, 141 transitions, 1411 flow [2024-01-27 15:34:29,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1398, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1411, PETRI_PLACES=102, PETRI_TRANSITIONS=141} [2024-01-27 15:34:29,704 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 49 predicate places. [2024-01-27 15:34:29,704 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 141 transitions, 1411 flow [2024-01-27 15:34:29,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:34:29,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:34:29,704 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, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:34:29,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 15:34:29,705 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)] === [2024-01-27 15:34:29,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:34:29,705 INFO L85 PathProgramCache]: Analyzing trace with hash 576845887, now seen corresponding path program 1 times [2024-01-27 15:34:29,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:34:29,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326653096] [2024-01-27 15:34:29,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:34:29,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:34:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:34:30,021 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:34:30,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:34:30,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326653096] [2024-01-27 15:34:30,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326653096] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:34:30,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210036640] [2024-01-27 15:34:30,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:34:30,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:34:30,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:34:30,036 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) [2024-01-27 15:34:30,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-01-27 15:34:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:34:30,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 17 conjunts are in the unsatisfiable core [2024-01-27 15:34:30,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:34:30,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:34:30,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:34:30,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:34:30,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210036640] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:34:30,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:34:30,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 11] total 25 [2024-01-27 15:34:30,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882995001] [2024-01-27 15:34:30,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:34:30,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-01-27 15:34:30,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:34:30,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-01-27 15:34:30,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2024-01-27 15:34:30,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 51 [2024-01-27 15:34:30,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 141 transitions, 1411 flow. Second operand has 26 states, 26 states have (on average 12.576923076923077) internal successors, (327), 26 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:34:30,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:34:30,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 51 [2024-01-27 15:34:30,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand