./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/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.5-wip.dd.update-z3-fca748b-m [2024-11-20 09:39:39,221 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 09:39:39,287 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 09:39:39,293 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 09:39:39,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 09:39:39,326 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 09:39:39,327 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 09:39:39,327 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 09:39:39,328 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 09:39:39,328 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 09:39:39,329 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 09:39:39,329 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 09:39:39,329 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 09:39:39,330 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 09:39:39,332 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 09:39:39,332 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 09:39:39,333 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 09:39:39,335 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 09:39:39,336 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 09:39:39,336 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 09:39:39,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 09:39:39,337 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 09:39:39,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 09:39:39,337 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 09:39:39,337 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 09:39:39,338 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 09:39:39,338 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 09:39:39,338 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 09:39:39,338 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 09:39:39,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 09:39:39,339 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 09:39:39,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 09:39:39,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:39:39,340 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 09:39:39,340 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 09:39:39,345 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 09:39:39,345 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 09:39:39,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 09:39:39,345 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 09:39:39,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 09:39:39,347 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 09:39:39,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 09:39:39,347 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-11-20 09:39:39,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 09:39:39,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 09:39:39,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 09:39:39,712 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 09:39:39,713 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 09:39:39,714 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2024-11-20 09:39:41,255 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 09:39:41,479 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 09:39:41,480 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2024-11-20 09:39:41,488 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/947caf8a0/431ac8088e5a4653bc977b8ee65731fe/FLAG05671ea8e [2024-11-20 09:39:41,500 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/947caf8a0/431ac8088e5a4653bc977b8ee65731fe [2024-11-20 09:39:41,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 09:39:41,504 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 09:39:41,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 09:39:41,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 09:39:41,509 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 09:39:41,510 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:39:41" (1/1) ... [2024-11-20 09:39:41,510 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef38a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:39:41, skipping insertion in model container [2024-11-20 09:39:41,511 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:39:41" (1/1) ... [2024-11-20 09:39:41,535 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 09:39:41,752 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c[4226,4239] [2024-11-20 09:39:41,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:39:41,771 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 09:39:41,819 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c[4226,4239] [2024-11-20 09:39:41,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:39:41,842 INFO L204 MainTranslator]: Completed translation [2024-11-20 09:39:41,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:39:41 WrapperNode [2024-11-20 09:39:41,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 09:39:41,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 09:39:41,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 09:39:41,844 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 09:39:41,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:39:41" (1/1) ... [2024-11-20 09:39:41,865 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:39:41" (1/1) ... [2024-11-20 09:39:41,901 INFO L138 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 307 [2024-11-20 09:39:41,902 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 09:39:41,902 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 09:39:41,902 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 09:39:41,903 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 09:39:41,915 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:39:41" (1/1) ... [2024-11-20 09:39:41,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:39:41" (1/1) ... [2024-11-20 09:39:41,927 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:39:41" (1/1) ... [2024-11-20 09:39:41,965 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-11-20 09:39:41,968 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:39:41" (1/1) ... [2024-11-20 09:39:41,968 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:39:41" (1/1) ... [2024-11-20 09:39:41,982 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:39:41" (1/1) ... [2024-11-20 09:39:41,988 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:39:41" (1/1) ... [2024-11-20 09:39:41,992 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:39:41" (1/1) ... [2024-11-20 09:39:41,994 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:39:41" (1/1) ... [2024-11-20 09:39:41,997 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 09:39:41,998 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 09:39:41,999 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 09:39:41,999 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 09:39:42,000 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:39:41" (1/1) ... [2024-11-20 09:39:42,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:39:42,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:39:42,033 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-11-20 09:39:42,035 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-11-20 09:39:42,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 09:39:42,075 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-20 09:39:42,075 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-20 09:39:42,075 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-20 09:39:42,075 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-20 09:39:42,075 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-20 09:39:42,075 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-20 09:39:42,075 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-20 09:39:42,075 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-20 09:39:42,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 09:39:42,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 09:39:42,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 09:39:42,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 09:39:42,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-20 09:39:42,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-20 09:39:42,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 09:39:42,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 09:39:42,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 09:39:42,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 09:39:42,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 09:39:42,079 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 09:39:42,242 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 09:39:42,244 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 09:39:42,725 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 09:39:42,725 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 09:39:43,149 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 09:39:43,150 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-20 09:39:43,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:39:43 BoogieIcfgContainer [2024-11-20 09:39:43,150 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 09:39:43,153 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 09:39:43,153 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 09:39:43,157 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 09:39:43,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:39:41" (1/3) ... [2024-11-20 09:39:43,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b65d1c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:39:43, skipping insertion in model container [2024-11-20 09:39:43,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:39:41" (2/3) ... [2024-11-20 09:39:43,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b65d1c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:39:43, skipping insertion in model container [2024-11-20 09:39:43,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:39:43" (3/3) ... [2024-11-20 09:39:43,162 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2024-11-20 09:39:43,183 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 09:39:43,183 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 09:39:43,183 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 09:39:43,261 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-20 09:39:43,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 48 transitions, 124 flow [2024-11-20 09:39:43,348 INFO L124 PetriNetUnfolderBase]: 6/44 cut-off events. [2024-11-20 09:39:43,349 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-20 09:39:43,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 44 events. 6/44 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-11-20 09:39:43,354 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 48 transitions, 124 flow [2024-11-20 09:39:43,359 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 43 transitions, 110 flow [2024-11-20 09:39:43,375 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 09:39:43,385 INFO L333 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, 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;@34f32f41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 09:39:43,385 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-20 09:39:43,409 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 09:39:43,409 INFO L124 PetriNetUnfolderBase]: 6/42 cut-off events. [2024-11-20 09:39:43,409 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-20 09:39:43,409 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:39:43,410 INFO L204 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] [2024-11-20 09:39:43,411 INFO L396 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-11-20 09:39:43,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:39:43,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1822743091, now seen corresponding path program 1 times [2024-11-20 09:39:43,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:39:43,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110658846] [2024-11-20 09:39:43,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:39:43,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:39:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:39:44,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:39:44,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:39:44,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110658846] [2024-11-20 09:39:44,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110658846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:39:44,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:39:44,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:39:44,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166266168] [2024-11-20 09:39:44,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:39:44,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:39:44,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:39:44,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:39:44,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:39:44,320 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-11-20 09:39:44,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 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-11-20 09:39:44,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:39:44,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-11-20 09:39:44,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:39:44,739 INFO L124 PetriNetUnfolderBase]: 1029/1674 cut-off events. [2024-11-20 09:39:44,739 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-11-20 09:39:44,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3312 conditions, 1674 events. 1029/1674 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 10239 event pairs, 110 based on Foata normal form. 80/1706 useless extension candidates. Maximal degree in co-relation 3168. Up to 997 conditions per place. [2024-11-20 09:39:44,765 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 51 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2024-11-20 09:39:44,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 70 transitions, 292 flow [2024-11-20 09:39:44,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:39:44,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 09:39:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2024-11-20 09:39:44,778 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6291666666666667 [2024-11-20 09:39:44,780 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 110 flow. Second operand 5 states and 151 transitions. [2024-11-20 09:39:44,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 70 transitions, 292 flow [2024-11-20 09:39:44,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 264 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-20 09:39:44,793 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 110 flow [2024-11-20 09:39:44,797 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2024-11-20 09:39:44,802 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2024-11-20 09:39:44,802 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 110 flow [2024-11-20 09:39:44,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 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-11-20 09:39:44,802 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:39:44,803 INFO L204 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-11-20 09:39:44,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 09:39:44,803 INFO L396 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-11-20 09:39:44,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:39:44,804 INFO L85 PathProgramCache]: Analyzing trace with hash 299568406, now seen corresponding path program 1 times [2024-11-20 09:39:44,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:39:44,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239611117] [2024-11-20 09:39:44,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:39:44,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:39:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:39:45,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 09:39:45,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:39:45,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239611117] [2024-11-20 09:39:45,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239611117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:39:45,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:39:45,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:39:45,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046153020] [2024-11-20 09:39:45,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:39:45,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:39:45,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:39:45,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:39:45,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:39:45,152 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-11-20 09:39:45,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 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-11-20 09:39:45,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:39:45,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-11-20 09:39:45,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:39:45,568 INFO L124 PetriNetUnfolderBase]: 1531/2294 cut-off events. [2024-11-20 09:39:45,569 INFO L125 PetriNetUnfolderBase]: For 493/790 co-relation queries the response was YES. [2024-11-20 09:39:45,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5039 conditions, 2294 events. 1531/2294 cut-off events. For 493/790 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 12739 event pairs, 168 based on Foata normal form. 381/2657 useless extension candidates. Maximal degree in co-relation 1398. Up to 1353 conditions per place. [2024-11-20 09:39:45,591 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 58 selfloop transitions, 7 changer transitions 0/80 dead transitions. [2024-11-20 09:39:45,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 80 transitions, 332 flow [2024-11-20 09:39:45,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:39:45,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 09:39:45,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2024-11-20 09:39:45,594 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6215277777777778 [2024-11-20 09:39:45,594 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 110 flow. Second operand 6 states and 179 transitions. [2024-11-20 09:39:45,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 80 transitions, 332 flow [2024-11-20 09:39:45,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 80 transitions, 323 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-20 09:39:45,599 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 155 flow [2024-11-20 09:39:45,600 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=155, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2024-11-20 09:39:45,601 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2024-11-20 09:39:45,601 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 155 flow [2024-11-20 09:39:45,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 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-11-20 09:39:45,601 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:39:45,601 INFO L204 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-11-20 09:39:45,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 09:39:45,602 INFO L396 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-11-20 09:39:45,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:39:45,604 INFO L85 PathProgramCache]: Analyzing trace with hash -101555562, now seen corresponding path program 2 times [2024-11-20 09:39:45,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:39:45,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572448833] [2024-11-20 09:39:45,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:39:45,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:39:45,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:39:45,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:39:45,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:39:45,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572448833] [2024-11-20 09:39:45,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572448833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:39:45,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:39:45,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 09:39:45,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979067475] [2024-11-20 09:39:45,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:39:45,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:39:45,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:39:45,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:39:45,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:39:45,831 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-11-20 09:39:45,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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-11-20 09:39:45,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:39:45,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-11-20 09:39:45,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:39:46,148 INFO L124 PetriNetUnfolderBase]: 1181/1915 cut-off events. [2024-11-20 09:39:46,149 INFO L125 PetriNetUnfolderBase]: For 2068/2430 co-relation queries the response was YES. [2024-11-20 09:39:46,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4869 conditions, 1915 events. 1181/1915 cut-off events. For 2068/2430 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 11568 event pairs, 811 based on Foata normal form. 430/2168 useless extension candidates. Maximal degree in co-relation 1779. Up to 1526 conditions per place. [2024-11-20 09:39:46,172 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 29 selfloop transitions, 2 changer transitions 17/67 dead transitions. [2024-11-20 09:39:46,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 297 flow [2024-11-20 09:39:46,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:39:46,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 09:39:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2024-11-20 09:39:46,177 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6291666666666667 [2024-11-20 09:39:46,177 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 155 flow. Second operand 5 states and 151 transitions. [2024-11-20 09:39:46,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 297 flow [2024-11-20 09:39:46,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 67 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 09:39:46,184 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 172 flow [2024-11-20 09:39:46,184 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2024-11-20 09:39:46,185 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2024-11-20 09:39:46,186 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 172 flow [2024-11-20 09:39:46,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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-11-20 09:39:46,186 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:39:46,187 INFO L204 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] [2024-11-20 09:39:46,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 09:39:46,187 INFO L396 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-11-20 09:39:46,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:39:46,188 INFO L85 PathProgramCache]: Analyzing trace with hash -319821762, now seen corresponding path program 1 times [2024-11-20 09:39:46,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:39:46,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778755990] [2024-11-20 09:39:46,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:39:46,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:39:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:39:46,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 09:39:46,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:39:46,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778755990] [2024-11-20 09:39:46,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778755990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:39:46,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:39:46,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:39:46,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001597050] [2024-11-20 09:39:46,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:39:46,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:39:46,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:39:46,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:39:46,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:39:46,422 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-11-20 09:39:46,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 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-11-20 09:39:46,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:39:46,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-11-20 09:39:46,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:39:47,027 INFO L124 PetriNetUnfolderBase]: 2547/4040 cut-off events. [2024-11-20 09:39:47,028 INFO L125 PetriNetUnfolderBase]: For 2576/2873 co-relation queries the response was YES. [2024-11-20 09:39:47,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9915 conditions, 4040 events. 2547/4040 cut-off events. For 2576/2873 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 26441 event pairs, 641 based on Foata normal form. 357/4304 useless extension candidates. Maximal degree in co-relation 9898. Up to 1387 conditions per place. [2024-11-20 09:39:47,062 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 70 selfloop transitions, 12 changer transitions 0/97 dead transitions. [2024-11-20 09:39:47,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 97 transitions, 471 flow [2024-11-20 09:39:47,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:39:47,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 09:39:47,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 190 transitions. [2024-11-20 09:39:47,068 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6597222222222222 [2024-11-20 09:39:47,069 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 172 flow. Second operand 6 states and 190 transitions. [2024-11-20 09:39:47,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 97 transitions, 471 flow [2024-11-20 09:39:47,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 97 transitions, 457 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-11-20 09:39:47,075 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 247 flow [2024-11-20 09:39:47,075 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=247, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2024-11-20 09:39:47,076 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2024-11-20 09:39:47,076 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 247 flow [2024-11-20 09:39:47,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 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-11-20 09:39:47,076 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:39:47,077 INFO L204 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] [2024-11-20 09:39:47,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 09:39:47,077 INFO L396 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-11-20 09:39:47,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:39:47,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1045503397, now seen corresponding path program 1 times [2024-11-20 09:39:47,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:39:47,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122352728] [2024-11-20 09:39:47,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:39:47,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:39:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:39:47,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:39:47,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:39:47,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122352728] [2024-11-20 09:39:47,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122352728] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 09:39:47,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581003568] [2024-11-20 09:39:47,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:39:47,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:39:47,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:39:47,918 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-11-20 09:39:47,920 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-11-20 09:39:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:39:48,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-20 09:39:48,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:39:48,134 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-11-20 09:39:48,526 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-11-20 09:39:48,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:39:48,536 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 09:39:49,223 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-11-20 09:39:49,231 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-11-20 09:39:49,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:39:49,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581003568] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 09:39:49,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 09:39:49,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-11-20 09:39:49,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100601778] [2024-11-20 09:39:49,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 09:39:49,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-20 09:39:49,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:39:49,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-20 09:39:49,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2024-11-20 09:39:49,398 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-11-20 09:39:49,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 247 flow. Second operand has 18 states, 18 states have (on average 24.38888888888889) internal successors, (439), 18 states have internal predecessors, (439), 0 states have call successors, (0), 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-11-20 09:39:49,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:39:49,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-11-20 09:39:49,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:39:51,595 INFO L124 PetriNetUnfolderBase]: 5529/8961 cut-off events. [2024-11-20 09:39:51,596 INFO L125 PetriNetUnfolderBase]: For 17032/17845 co-relation queries the response was YES. [2024-11-20 09:39:51,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26169 conditions, 8961 events. 5529/8961 cut-off events. For 17032/17845 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 65594 event pairs, 727 based on Foata normal form. 781/9312 useless extension candidates. Maximal degree in co-relation 14369. Up to 3567 conditions per place. [2024-11-20 09:39:51,702 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 141 selfloop transitions, 39 changer transitions 2/204 dead transitions. [2024-11-20 09:39:51,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 204 transitions, 1180 flow [2024-11-20 09:39:51,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 09:39:51,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-20 09:39:51,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 499 transitions. [2024-11-20 09:39:51,705 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6497395833333334 [2024-11-20 09:39:51,706 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 247 flow. Second operand 16 states and 499 transitions. [2024-11-20 09:39:51,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 204 transitions, 1180 flow [2024-11-20 09:39:51,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 204 transitions, 1159 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-11-20 09:39:51,751 INFO L231 Difference]: Finished difference. Result has 79 places, 97 transitions, 594 flow [2024-11-20 09:39:51,751 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=594, PETRI_PLACES=79, PETRI_TRANSITIONS=97} [2024-11-20 09:39:51,752 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 29 predicate places. [2024-11-20 09:39:51,752 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 97 transitions, 594 flow [2024-11-20 09:39:51,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 24.38888888888889) internal successors, (439), 18 states have internal predecessors, (439), 0 states have call successors, (0), 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-11-20 09:39:51,752 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:39:51,753 INFO L204 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] [2024-11-20 09:39:51,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 09:39:51,953 WARN L453 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-11-20 09:39:51,954 INFO L396 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-11-20 09:39:51,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:39:51,954 INFO L85 PathProgramCache]: Analyzing trace with hash -923014525, now seen corresponding path program 2 times [2024-11-20 09:39:51,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:39:51,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500465168] [2024-11-20 09:39:51,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:39:51,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:39:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:39:52,057 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 09:39:52,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:39:52,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500465168] [2024-11-20 09:39:52,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500465168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:39:52,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:39:52,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 09:39:52,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458447504] [2024-11-20 09:39:52,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:39:52,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 09:39:52,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:39:52,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 09:39:52,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:39:52,064 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-11-20 09:39:52,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 97 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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-11-20 09:39:52,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:39:52,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-11-20 09:39:52,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:39:53,410 INFO L124 PetriNetUnfolderBase]: 5278/8514 cut-off events. [2024-11-20 09:39:53,411 INFO L125 PetriNetUnfolderBase]: For 19907/20461 co-relation queries the response was YES. [2024-11-20 09:39:53,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26186 conditions, 8514 events. 5278/8514 cut-off events. For 19907/20461 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 61277 event pairs, 569 based on Foata normal form. 552/8684 useless extension candidates. Maximal degree in co-relation 20126. Up to 6668 conditions per place. [2024-11-20 09:39:53,517 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 69 selfloop transitions, 13 changer transitions 0/104 dead transitions. [2024-11-20 09:39:53,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 104 transitions, 749 flow [2024-11-20 09:39:53,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 09:39:53,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 09:39:53,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-11-20 09:39:53,519 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2024-11-20 09:39:53,519 INFO L175 Difference]: Start difference. First operand has 79 places, 97 transitions, 594 flow. Second operand 3 states and 102 transitions. [2024-11-20 09:39:53,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 104 transitions, 749 flow [2024-11-20 09:39:53,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 104 transitions, 717 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-11-20 09:39:53,570 INFO L231 Difference]: Finished difference. Result has 79 places, 93 transitions, 552 flow [2024-11-20 09:39:53,570 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=79, PETRI_TRANSITIONS=93} [2024-11-20 09:39:53,571 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 29 predicate places. [2024-11-20 09:39:53,571 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 93 transitions, 552 flow [2024-11-20 09:39:53,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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-11-20 09:39:53,572 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:39:53,572 INFO L204 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] [2024-11-20 09:39:53,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 09:39:53,573 INFO L396 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-11-20 09:39:53,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:39:53,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1359268175, now seen corresponding path program 1 times [2024-11-20 09:39:53,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:39:53,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426781495] [2024-11-20 09:39:53,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:39:53,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:39:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:39:54,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:39:54,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:39:54,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426781495] [2024-11-20 09:39:54,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426781495] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 09:39:54,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530383112] [2024-11-20 09:39:54,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:39:54,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:39:54,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:39:54,879 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-11-20 09:39:54,881 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-11-20 09:39:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:39:54,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 09:39:55,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:39:55,194 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-11-20 09:39:55,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 09:39:55,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 09:39:55,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:39:55,272 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-11-20 09:39:55,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 09:39:55,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530383112] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 09:39:55,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 09:39:55,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 5] total 15 [2024-11-20 09:39:55,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353137702] [2024-11-20 09:39:55,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 09:39:55,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 09:39:55,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:39:55,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 09:39:55,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-20 09:39:55,486 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-11-20 09:39:55,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 93 transitions, 552 flow. Second operand has 16 states, 16 states have (on average 24.5625) internal successors, (393), 16 states have internal predecessors, (393), 0 states have call successors, (0), 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-11-20 09:39:55,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:39:55,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-11-20 09:39:55,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:39:57,571 INFO L124 PetriNetUnfolderBase]: 7666/12626 cut-off events. [2024-11-20 09:39:57,571 INFO L125 PetriNetUnfolderBase]: For 29569/30619 co-relation queries the response was YES. [2024-11-20 09:39:57,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38435 conditions, 12626 events. 7666/12626 cut-off events. For 29569/30619 co-relation queries the response was YES. Maximal size of possible extension queue 838. Compared 98224 event pairs, 435 based on Foata normal form. 846/13046 useless extension candidates. Maximal degree in co-relation 29039. Up to 4333 conditions per place. [2024-11-20 09:39:57,670 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 107 selfloop transitions, 69 changer transitions 1/199 dead transitions. [2024-11-20 09:39:57,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 199 transitions, 1381 flow [2024-11-20 09:39:57,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 09:39:57,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-20 09:39:57,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 460 transitions. [2024-11-20 09:39:57,672 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5989583333333334 [2024-11-20 09:39:57,672 INFO L175 Difference]: Start difference. First operand has 79 places, 93 transitions, 552 flow. Second operand 16 states and 460 transitions. [2024-11-20 09:39:57,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 199 transitions, 1381 flow [2024-11-20 09:39:57,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 199 transitions, 1341 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 09:39:57,717 INFO L231 Difference]: Finished difference. Result has 95 places, 125 transitions, 977 flow [2024-11-20 09:39:57,717 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=977, PETRI_PLACES=95, PETRI_TRANSITIONS=125} [2024-11-20 09:39:57,718 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 45 predicate places. [2024-11-20 09:39:57,718 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 125 transitions, 977 flow [2024-11-20 09:39:57,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 24.5625) internal successors, (393), 16 states have internal predecessors, (393), 0 states have call successors, (0), 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-11-20 09:39:57,719 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:39:57,720 INFO L204 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-11-20 09:39:57,730 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-11-20 09:39:57,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-20 09:39:57,926 INFO L396 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-11-20 09:39:57,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:39:57,926 INFO L85 PathProgramCache]: Analyzing trace with hash -242120112, now seen corresponding path program 1 times [2024-11-20 09:39:57,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:39:57,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273877563] [2024-11-20 09:39:57,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:39:57,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:39:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:39:58,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 09:39:58,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:39:58,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273877563] [2024-11-20 09:39:58,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273877563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:39:58,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:39:58,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 09:39:58,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548101408] [2024-11-20 09:39:58,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:39:58,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 09:39:58,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:39:58,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 09:39:58,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:39:58,063 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-11-20 09:39:58,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 125 transitions, 977 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-11-20 09:39:58,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:39:58,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-11-20 09:39:58,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:40:00,006 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][151], [Black: 70#(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: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 4#L110true, 25#L56true, Black: 319#(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)))), 96#true, Black: 103#(<= 1 ~total~0), 351#true, 31#L92true, 604#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 13#L143-4true, Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 360#(<= 1 ~total~0), 19#L74true, Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-11-20 09:40:00,007 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-20 09:40:00,007 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-20 09:40:00,007 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-20 09:40:00,007 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-20 09:40:00,064 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][151], [8#L144true, Black: 70#(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: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 4#L110true, 25#L56true, Black: 319#(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)))), 96#true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 351#true, 31#L92true, 604#true, Black: 360#(<= 1 ~total~0), Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 19#L74true, Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))]) [2024-11-20 09:40:00,064 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-20 09:40:00,064 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-20 09:40:00,064 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-20 09:40:00,064 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-20 09:40:00,108 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][151], [Black: 70#(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: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 4#L110true, 15#thread1EXITtrue, Black: 319#(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)))), 96#true, Black: 103#(<= 1 ~total~0), 351#true, 31#L92true, 604#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 13#L143-4true, Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 360#(<= 1 ~total~0), 19#L74true, Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))]) [2024-11-20 09:40:00,108 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-20 09:40:00,108 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-20 09:40:00,108 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-20 09:40:00,108 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-20 09:40:00,110 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][151], [Black: 70#(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: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 4#L110true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 25#L56true, Black: 319#(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)))), 96#true, Black: 103#(<= 1 ~total~0), 351#true, 31#L92true, 604#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 13#L143-4true, Black: 360#(<= 1 ~total~0), Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), 23#thread2EXITtrue, Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-11-20 09:40:00,110 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-20 09:40:00,110 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-20 09:40:00,110 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-20 09:40:00,110 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-20 09:40:00,111 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][151], [2#thread4EXITtrue, Black: 70#(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: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 25#L56true, Black: 319#(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)))), 96#true, Black: 103#(<= 1 ~total~0), 351#true, 31#L92true, 604#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 13#L143-4true, Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 360#(<= 1 ~total~0), 19#L74true, Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-11-20 09:40:00,111 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-20 09:40:00,111 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-20 09:40:00,111 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-20 09:40:00,111 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-20 09:40:00,142 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][151], [8#L144true, Black: 70#(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: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 4#L110true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 15#thread1EXITtrue, 96#true, Black: 319#(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)))), 351#true, 31#L92true, 604#true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), Black: 360#(<= 1 ~total~0), Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 19#L74true, Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-11-20 09:40:00,143 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-20 09:40:00,143 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-20 09:40:00,143 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-20 09:40:00,143 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-20 09:40:00,145 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][151], [8#L144true, Black: 70#(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: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 25#L56true, 4#L110true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 319#(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)))), 96#true, 351#true, 31#L92true, 604#true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), Black: 360#(<= 1 ~total~0), Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 23#thread2EXITtrue]) [2024-11-20 09:40:00,145 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-20 09:40:00,145 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-20 09:40:00,145 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-20 09:40:00,145 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-20 09:40:00,146 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][151], [8#L144true, 2#thread4EXITtrue, Black: 70#(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: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 25#L56true, Black: 319#(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)))), 96#true, Black: 103#(<= 1 ~total~0), 351#true, 31#L92true, 604#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), Black: 360#(<= 1 ~total~0), Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 19#L74true, Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-11-20 09:40:00,146 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-20 09:40:00,146 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-20 09:40:00,146 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-20 09:40:00,146 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-20 09:40:00,170 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][151], [Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 6#L144-1true, Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 4#L110true, Black: 319#(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)))), 96#true, Black: 103#(<= 1 ~total~0), 351#true, 31#L92true, 604#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 360#(<= 1 ~total~0), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 19#L74true, Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-11-20 09:40:00,170 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-11-20 09:40:00,170 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-20 09:40:00,171 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-20 09:40:00,171 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-20 09:40:00,171 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][151], [Black: 70#(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: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 4#L110true, 15#thread1EXITtrue, Black: 319#(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)))), 96#true, Black: 103#(<= 1 ~total~0), 351#true, 31#L92true, 604#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 13#L143-4true, Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 360#(<= 1 ~total~0), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), 23#thread2EXITtrue, Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-11-20 09:40:00,171 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-11-20 09:40:00,171 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-20 09:40:00,171 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-20 09:40:00,171 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-20 09:40:00,172 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][151], [2#thread4EXITtrue, Black: 70#(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: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 15#thread1EXITtrue, Black: 319#(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)))), 96#true, Black: 103#(<= 1 ~total~0), 351#true, 31#L92true, 604#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 13#L143-4true, Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 360#(<= 1 ~total~0), 19#L74true, Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))]) [2024-11-20 09:40:00,172 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-11-20 09:40:00,172 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-20 09:40:00,172 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-20 09:40:00,172 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-20 09:40:00,173 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][151], [2#thread4EXITtrue, Black: 70#(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: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 25#L56true, Black: 319#(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)))), 96#true, 604#true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 351#true, 31#L92true, 13#L143-4true, Black: 360#(<= 1 ~total~0), Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), 23#thread2EXITtrue, Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))]) [2024-11-20 09:40:00,173 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-11-20 09:40:00,173 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-20 09:40:00,173 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-20 09:40:00,174 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-20 09:40:00,185 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][151], [8#L144true, Black: 70#(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: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 4#L110true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 15#thread1EXITtrue, 96#true, Black: 319#(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)))), 351#true, 31#L92true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 604#true, Black: 360#(<= 1 ~total~0), Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 23#thread2EXITtrue, Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-11-20 09:40:00,185 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-20 09:40:00,185 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-20 09:40:00,185 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-20 09:40:00,185 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-20 09:40:00,186 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][151], [8#L144true, 2#thread4EXITtrue, Black: 70#(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: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 15#thread1EXITtrue, Black: 319#(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)))), 96#true, Black: 103#(<= 1 ~total~0), 351#true, 31#L92true, 604#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), Black: 360#(<= 1 ~total~0), Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 19#L74true, Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-11-20 09:40:00,186 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-20 09:40:00,186 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-20 09:40:00,186 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-20 09:40:00,186 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-20 09:40:00,187 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][151], [8#L144true, 2#thread4EXITtrue, Black: 70#(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: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 25#L56true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 319#(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)))), 96#true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 351#true, 31#L92true, 604#true, Black: 360#(<= 1 ~total~0), Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 23#thread2EXITtrue, Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))]) [2024-11-20 09:40:00,187 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-20 09:40:00,187 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-20 09:40:00,187 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-20 09:40:00,187 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-20 09:40:00,196 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][151], [Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 6#L144-1true, Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 4#L110true, Black: 319#(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)))), 96#true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 351#true, 31#L92true, 604#true, Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 360#(<= 1 ~total~0), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), 23#thread2EXITtrue, Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))]) [2024-11-20 09:40:00,196 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-11-20 09:40:00,196 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-11-20 09:40:00,196 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-20 09:40:00,196 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-20 09:40:00,197 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][151], [2#thread4EXITtrue, Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 6#L144-1true, Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 319#(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)))), 96#true, Black: 103#(<= 1 ~total~0), 351#true, 31#L92true, 604#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 360#(<= 1 ~total~0), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 19#L74true, Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-11-20 09:40:00,197 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-11-20 09:40:00,197 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-20 09:40:00,197 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-20 09:40:00,197 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-20 09:40:00,198 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][151], [2#thread4EXITtrue, Black: 70#(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: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 15#thread1EXITtrue, Black: 319#(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)))), 96#true, Black: 103#(<= 1 ~total~0), 351#true, 31#L92true, 604#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 13#L143-4true, Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 360#(<= 1 ~total~0), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), 23#thread2EXITtrue, Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-11-20 09:40:00,198 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-11-20 09:40:00,198 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-20 09:40:00,198 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-20 09:40:00,198 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-20 09:40:00,202 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][151], [8#L144true, 2#thread4EXITtrue, Black: 70#(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: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 15#thread1EXITtrue, Black: 319#(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)))), 96#true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 351#true, 31#L92true, 604#true, Black: 360#(<= 1 ~total~0), Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), 23#thread2EXITtrue, Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))]) [2024-11-20 09:40:00,202 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-11-20 09:40:00,202 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-20 09:40:00,202 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-20 09:40:00,203 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-20 09:40:00,203 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][151], [Black: 70#(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: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 36#L145true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 4#L110true, 96#true, Black: 319#(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)))), 351#true, 31#L92true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 604#true, Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 360#(<= 1 ~total~0), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-11-20 09:40:00,203 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-11-20 09:40:00,203 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-20 09:40:00,203 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-20 09:40:00,203 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-11-20 09:40:00,205 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][151], [2#thread4EXITtrue, Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 6#L144-1true, Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 319#(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)))), 96#true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 351#true, 31#L92true, 604#true, Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 360#(<= 1 ~total~0), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), 23#thread2EXITtrue, Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))]) [2024-11-20 09:40:00,205 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-11-20 09:40:00,205 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-11-20 09:40:00,205 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-20 09:40:00,205 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-20 09:40:00,206 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][151], [2#thread4EXITtrue, Black: 70#(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: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 36#L145true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 319#(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)))), 96#true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 351#true, 31#L92true, 604#true, Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 360#(<= 1 ~total~0), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))]) [2024-11-20 09:40:00,206 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-11-20 09:40:00,206 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-20 09:40:00,206 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-11-20 09:40:00,207 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-11-20 09:40:00,207 INFO L124 PetriNetUnfolderBase]: 10977/17542 cut-off events. [2024-11-20 09:40:00,207 INFO L125 PetriNetUnfolderBase]: For 75035/77144 co-relation queries the response was YES. [2024-11-20 09:40:00,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58243 conditions, 17542 events. 10977/17542 cut-off events. For 75035/77144 co-relation queries the response was YES. Maximal size of possible extension queue 952. Compared 133167 event pairs, 2798 based on Foata normal form. 1872/18654 useless extension candidates. Maximal degree in co-relation 39756. Up to 8935 conditions per place. [2024-11-20 09:40:00,352 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 150 selfloop transitions, 9 changer transitions 0/181 dead transitions. [2024-11-20 09:40:00,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 181 transitions, 1854 flow [2024-11-20 09:40:00,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 09:40:00,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 09:40:00,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-11-20 09:40:00,354 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7430555555555556 [2024-11-20 09:40:00,354 INFO L175 Difference]: Start difference. First operand has 95 places, 125 transitions, 977 flow. Second operand 3 states and 107 transitions. [2024-11-20 09:40:00,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 181 transitions, 1854 flow [2024-11-20 09:40:00,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 181 transitions, 1796 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-11-20 09:40:00,449 INFO L231 Difference]: Finished difference. Result has 94 places, 126 transitions, 998 flow [2024-11-20 09:40:00,449 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=998, PETRI_PLACES=94, PETRI_TRANSITIONS=126} [2024-11-20 09:40:00,450 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 44 predicate places. [2024-11-20 09:40:00,453 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 126 transitions, 998 flow [2024-11-20 09:40:00,454 INFO L472 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-11-20 09:40:00,454 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:40:00,454 INFO L204 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] [2024-11-20 09:40:00,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 09:40:00,454 INFO L396 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-11-20 09:40:00,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:40:00,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1604433398, now seen corresponding path program 3 times [2024-11-20 09:40:00,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:40:00,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335241851] [2024-11-20 09:40:00,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:40:00,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:40:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:40:00,587 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 09:40:00,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:40:00,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335241851] [2024-11-20 09:40:00,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335241851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 09:40:00,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666526957] [2024-11-20 09:40:00,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 09:40:00,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:40:00,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:40:00,591 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-11-20 09:40:00,593 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-11-20 09:40:00,708 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-20 09:40:00,708 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 09:40:00,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 09:40:00,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:40:00,746 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 09:40:00,746 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 09:40:00,842 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 09:40:00,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666526957] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 09:40:00,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 09:40:00,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2024-11-20 09:40:00,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561599125] [2024-11-20 09:40:00,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 09:40:00,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 09:40:00,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:40:00,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 09:40:00,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-20 09:40:00,862 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-11-20 09:40:00,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 126 transitions, 998 flow. Second operand has 8 states, 8 states have (on average 25.75) internal successors, (206), 8 states have internal predecessors, (206), 0 states have call successors, (0), 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-11-20 09:40:00,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:40:00,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-11-20 09:40:00,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:40:04,078 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][163], [608#true, Black: 70#(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: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 4#L110true, 25#L56true, Black: 319#(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)))), 96#true, 604#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 351#true, 31#L92true, Black: 103#(<= 1 ~total~0), 13#L143-4true, Black: 360#(<= 1 ~total~0), 19#L74true, Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 606#(<= ~q2_back~0 ~q2_front~0), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-11-20 09:40:04,079 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-20 09:40:04,079 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-20 09:40:04,079 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-20 09:40:04,079 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-20 09:40:04,234 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][163], [608#true, 8#L144true, Black: 70#(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: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 4#L110true, 25#L56true, Black: 319#(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)))), 96#true, 604#true, 351#true, 31#L92true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), Black: 360#(<= 1 ~total~0), 19#L74true, Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 606#(<= ~q2_back~0 ~q2_front~0), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-11-20 09:40:04,234 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-11-20 09:40:04,235 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-20 09:40:04,235 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-20 09:40:04,235 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-20 09:40:04,440 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][163], [608#true, Black: 70#(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: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 4#L110true, 25#L56true, Black: 319#(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)))), 96#true, 604#true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 31#L92true, 351#true, 13#L143-4true, Black: 360#(<= 1 ~total~0), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), 23#thread2EXITtrue, Black: 606#(<= ~q2_back~0 ~q2_front~0), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))]) [2024-11-20 09:40:04,440 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-20 09:40:04,440 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-20 09:40:04,440 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-20 09:40:04,440 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-20 09:40:04,448 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][163], [608#true, Black: 70#(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: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 4#L110true, 15#thread1EXITtrue, Black: 319#(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)))), 96#true, 604#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), Black: 103#(<= 1 ~total~0), 351#true, 31#L92true, 13#L143-4true, Black: 360#(<= 1 ~total~0), 19#L74true, Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 606#(<= ~q2_back~0 ~q2_front~0), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))]) [2024-11-20 09:40:04,448 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-20 09:40:04,448 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-20 09:40:04,448 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-20 09:40:04,448 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-20 09:40:04,501 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][163], [608#true, 8#L144true, Black: 70#(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: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 25#L56true, 4#L110true, Black: 319#(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)))), 96#true, 604#true, Black: 103#(<= 1 ~total~0), 31#L92true, 351#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), Black: 360#(<= 1 ~total~0), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), 23#thread2EXITtrue, Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 606#(<= ~q2_back~0 ~q2_front~0)]) [2024-11-20 09:40:04,501 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-11-20 09:40:04,501 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-20 09:40:04,501 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-20 09:40:04,501 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-20 09:40:04,508 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][163], [608#true, 8#L144true, Black: 70#(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: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 4#L110true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 15#thread1EXITtrue, Black: 319#(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)))), 96#true, 604#true, 351#true, 31#L92true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), Black: 360#(<= 1 ~total~0), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), 19#L74true, Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 606#(<= ~q2_back~0 ~q2_front~0), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))]) [2024-11-20 09:40:04,509 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-11-20 09:40:04,509 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-20 09:40:04,509 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-20 09:40:04,509 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-20 09:40:04,543 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][163], [608#true, Black: 70#(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: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 4#L110true, 15#thread1EXITtrue, 96#true, Black: 319#(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)))), 31#L92true, 351#true, 604#true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 13#L143-4true, Black: 360#(<= 1 ~total~0), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), 23#thread2EXITtrue, Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 606#(<= ~q2_back~0 ~q2_front~0)]) [2024-11-20 09:40:04,543 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-11-20 09:40:04,543 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-20 09:40:04,543 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-20 09:40:04,544 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-20 09:40:04,549 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][163], [608#true, Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 6#L144-1true, Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 4#L110true, Black: 319#(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)))), 96#true, 31#L92true, 604#true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 351#true, Black: 360#(<= 1 ~total~0), 19#L74true, Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 606#(<= ~q2_back~0 ~q2_front~0)]) [2024-11-20 09:40:04,550 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-11-20 09:40:04,550 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-20 09:40:04,550 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-20 09:40:04,550 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-20 09:40:04,576 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][163], [608#true, 8#L144true, Black: 70#(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: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 4#L110true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 15#thread1EXITtrue, 96#true, Black: 319#(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)))), 31#L92true, 351#true, 604#true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), Black: 360#(<= 1 ~total~0), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), 23#thread2EXITtrue, Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 606#(<= ~q2_back~0 ~q2_front~0), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-11-20 09:40:04,576 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-11-20 09:40:04,576 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-20 09:40:04,576 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-20 09:40:04,576 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-20 09:40:04,601 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][163], [608#true, Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 6#L144-1true, Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 4#L110true, Black: 319#(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)))), 96#true, 604#true, Black: 103#(<= 1 ~total~0), 31#L92true, 351#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), Black: 360#(<= 1 ~total~0), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), 23#thread2EXITtrue, Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 606#(<= ~q2_back~0 ~q2_front~0), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))]) [2024-11-20 09:40:04,601 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-11-20 09:40:04,601 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-11-20 09:40:04,601 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-20 09:40:04,602 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-11-20 09:40:04,613 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 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)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) 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_122} 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_121, 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][163], [608#true, Black: 70#(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: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 36#L145true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 4#L110true, Black: 319#(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)))), 96#true, 604#true, Black: 103#(<= 1 ~total~0), 31#L92true, 351#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), Black: 360#(<= 1 ~total~0), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 606#(<= ~q2_back~0 ~q2_front~0)]) [2024-11-20 09:40:04,613 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-11-20 09:40:04,613 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-20 09:40:04,613 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-11-20 09:40:04,613 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-11-20 09:40:04,619 INFO L124 PetriNetUnfolderBase]: 17880/29508 cut-off events. [2024-11-20 09:40:04,619 INFO L125 PetriNetUnfolderBase]: For 100037/102361 co-relation queries the response was YES. [2024-11-20 09:40:04,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98217 conditions, 29508 events. 17880/29508 cut-off events. For 100037/102361 co-relation queries the response was YES. Maximal size of possible extension queue 1590. Compared 252975 event pairs, 2497 based on Foata normal form. 2097/30657 useless extension candidates. Maximal degree in co-relation 93095. Up to 12603 conditions per place. [2024-11-20 09:40:04,901 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 128 selfloop transitions, 44 changer transitions 0/194 dead transitions. [2024-11-20 09:40:04,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 194 transitions, 1792 flow [2024-11-20 09:40:04,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:40:04,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 09:40:04,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2024-11-20 09:40:04,903 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.78125 [2024-11-20 09:40:04,903 INFO L175 Difference]: Start difference. First operand has 94 places, 126 transitions, 998 flow. Second operand 4 states and 150 transitions. [2024-11-20 09:40:04,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 194 transitions, 1792 flow [2024-11-20 09:40:05,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 194 transitions, 1781 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 09:40:05,163 INFO L231 Difference]: Finished difference. Result has 98 places, 145 transitions, 1413 flow [2024-11-20 09:40:05,164 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=989, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1413, PETRI_PLACES=98, PETRI_TRANSITIONS=145} [2024-11-20 09:40:05,164 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 48 predicate places. [2024-11-20 09:40:05,164 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 145 transitions, 1413 flow [2024-11-20 09:40:05,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.75) internal successors, (206), 8 states have internal predecessors, (206), 0 states have call successors, (0), 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-11-20 09:40:05,165 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:40:05,165 INFO L204 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-11-20 09:40:05,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 09:40:05,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:40:05,366 INFO L396 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-11-20 09:40:05,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:40:05,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1461972397, now seen corresponding path program 1 times [2024-11-20 09:40:05,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:40:05,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576566393] [2024-11-20 09:40:05,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:40:05,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:40:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:40:05,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 09:40:05,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:40:05,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576566393] [2024-11-20 09:40:05,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576566393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:40:05,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:40:05,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:40:05,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718186252] [2024-11-20 09:40:05,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:40:05,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:40:05,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:40:05,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:40:05,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:40:05,489 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-11-20 09:40:05,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 145 transitions, 1413 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-11-20 09:40:05,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:40:05,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-11-20 09:40:05,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:40:09,719 INFO L124 PetriNetUnfolderBase]: 20357/33449 cut-off events. [2024-11-20 09:40:09,719 INFO L125 PetriNetUnfolderBase]: For 167268/170001 co-relation queries the response was YES. [2024-11-20 09:40:09,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122855 conditions, 33449 events. 20357/33449 cut-off events. For 167268/170001 co-relation queries the response was YES. Maximal size of possible extension queue 1813. Compared 295800 event pairs, 13305 based on Foata normal form. 3101/34402 useless extension candidates. Maximal degree in co-relation 114240. Up to 18446 conditions per place. [2024-11-20 09:40:09,897 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 145 selfloop transitions, 11 changer transitions 15/193 dead transitions. [2024-11-20 09:40:09,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 193 transitions, 2282 flow [2024-11-20 09:40:09,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:40:09,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 09:40:09,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2024-11-20 09:40:09,898 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6875 [2024-11-20 09:40:09,898 INFO L175 Difference]: Start difference. First operand has 98 places, 145 transitions, 1413 flow. Second operand 4 states and 132 transitions. [2024-11-20 09:40:09,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 193 transitions, 2282 flow [2024-11-20 09:40:10,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 193 transitions, 2262 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-20 09:40:10,079 INFO L231 Difference]: Finished difference. Result has 101 places, 138 transitions, 1361 flow [2024-11-20 09:40:10,079 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1348, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1361, PETRI_PLACES=101, PETRI_TRANSITIONS=138} [2024-11-20 09:40:10,079 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 51 predicate places. [2024-11-20 09:40:10,080 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 138 transitions, 1361 flow [2024-11-20 09:40:10,080 INFO L472 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-11-20 09:40:10,080 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:40:10,080 INFO L204 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] [2024-11-20 09:40:10,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 09:40:10,081 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-20 09:40:10,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:40:10,081 INFO L85 PathProgramCache]: Analyzing trace with hash -126545709, now seen corresponding path program 1 times [2024-11-20 09:40:10,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:40:10,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190207690] [2024-11-20 09:40:10,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:40:10,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:40:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:40:10,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 09:40:10,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:40:10,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190207690] [2024-11-20 09:40:10,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190207690] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 09:40:10,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855034275] [2024-11-20 09:40:10,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:40:10,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:40:10,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:40:10,424 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-11-20 09:40:10,426 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-11-20 09:40:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:40:10,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-20 09:40:10,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:40:10,866 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 09:40:10,866 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 09:40:11,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 09:40:11,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855034275] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 09:40:11,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 09:40:11,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 25 [2024-11-20 09:40:11,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591869002] [2024-11-20 09:40:11,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 09:40:11,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-20 09:40:11,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:40:11,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-20 09:40:11,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2024-11-20 09:40:11,599 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-11-20 09:40:11,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 138 transitions, 1361 flow. Second operand has 26 states, 26 states have (on average 15.115384615384615) internal successors, (393), 26 states have internal predecessors, (393), 0 states have call successors, (0), 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-11-20 09:40:11,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:40:11,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-11-20 09:40:11,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand