./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e5124dd4a5a155d8a4e322a35428820633f9eccdd993e14120e650d1ba1fbebe --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:55:28,732 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:55:28,818 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 02:55:28,827 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:55:28,827 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:55:28,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:55:28,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:55:28,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:55:28,856 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:55:28,856 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:55:28,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:55:28,856 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:55:28,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:55:28,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:55:28,857 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:55:28,857 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:55:28,857 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:55:28,857 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:55:28,857 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:55:28,858 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:55:28,858 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 02:55:28,858 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 02:55:28,858 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 02:55:28,858 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:55:28,858 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 02:55:28,858 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 02:55:28,858 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:55:28,860 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:55:28,860 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:55:28,860 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:55:28,861 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:55:28,861 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:55:28,861 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:55:28,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:55:28,862 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:55:28,862 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:55:28,862 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:55:28,862 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:55:28,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:55:28,862 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:55:28,862 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:55:28,862 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:55:28,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:55:28,862 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:55:28,862 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:55:28,863 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:55:28,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:55:28,863 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e5124dd4a5a155d8a4e322a35428820633f9eccdd993e14120e650d1ba1fbebe [2024-11-28 02:55:29,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:55:29,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:55:29,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:55:29,157 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:55:29,157 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:55:29,159 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c [2024-11-28 02:55:32,178 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/data/dbcb0f3a8/6b1aa020da704265a6f66f13b4b703f9/FLAGcd6bfc7b5 [2024-11-28 02:55:32,536 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:55:32,541 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c [2024-11-28 02:55:32,559 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/data/dbcb0f3a8/6b1aa020da704265a6f66f13b4b703f9/FLAGcd6bfc7b5 [2024-11-28 02:55:32,580 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/data/dbcb0f3a8/6b1aa020da704265a6f66f13b4b703f9 [2024-11-28 02:55:32,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:55:32,585 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:55:32,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:55:32,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:55:32,593 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:55:32,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:55:32" (1/1) ... [2024-11-28 02:55:32,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2025d292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:32, skipping insertion in model container [2024-11-28 02:55:32,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:55:32" (1/1) ... [2024-11-28 02:55:32,622 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:55:32,847 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:55:32,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:55:32,873 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:55:32,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:55:32,947 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:55:32,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:32 WrapperNode [2024-11-28 02:55:32,947 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:55:32,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:55:32,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:55:32,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:55:32,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:32" (1/1) ... [2024-11-28 02:55:32,967 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:32" (1/1) ... [2024-11-28 02:55:33,006 INFO L138 Inliner]: procedures = 26, calls = 61, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 292 [2024-11-28 02:55:33,010 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:55:33,010 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:55:33,010 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:55:33,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:55:33,025 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:32" (1/1) ... [2024-11-28 02:55:33,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:32" (1/1) ... [2024-11-28 02:55:33,031 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:32" (1/1) ... [2024-11-28 02:55:33,064 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-28 02:55:33,064 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:32" (1/1) ... [2024-11-28 02:55:33,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:32" (1/1) ... [2024-11-28 02:55:33,078 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:32" (1/1) ... [2024-11-28 02:55:33,083 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:32" (1/1) ... [2024-11-28 02:55:33,092 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:32" (1/1) ... [2024-11-28 02:55:33,097 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:32" (1/1) ... [2024-11-28 02:55:33,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:32" (1/1) ... [2024-11-28 02:55:33,105 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:55:33,109 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:55:33,109 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:55:33,109 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:55:33,110 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:32" (1/1) ... [2024-11-28 02:55:33,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:55:33,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:55:33,143 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:55:33,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:55:33,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:55:33,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 02:55:33,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 02:55:33,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 02:55:33,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 02:55:33,177 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-28 02:55:33,177 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-28 02:55:33,177 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-28 02:55:33,178 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-28 02:55:33,178 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-28 02:55:33,178 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-28 02:55:33,178 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-28 02:55:33,178 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-28 02:55:33,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 02:55:33,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 02:55:33,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-28 02:55:33,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-28 02:55:33,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 02:55:33,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:55:33,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:55:33,180 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 02:55:33,345 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:55:33,347 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:55:33,974 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 02:55:33,974 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:55:34,567 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:55:34,570 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-28 02:55:34,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:55:34 BoogieIcfgContainer [2024-11-28 02:55:34,571 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:55:34,573 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:55:34,574 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:55:34,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:55:34,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:55:32" (1/3) ... [2024-11-28 02:55:34,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c43bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:55:34, skipping insertion in model container [2024-11-28 02:55:34,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:55:32" (2/3) ... [2024-11-28 02:55:34,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c43bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:55:34, skipping insertion in model container [2024-11-28 02:55:34,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:55:34" (3/3) ... [2024-11-28 02:55:34,583 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult.wvr.c [2024-11-28 02:55:34,599 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:55:34,601 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-mult.wvr.c that has 5 procedures, 61 locations, 1 initial locations, 6 loop locations, and 14 error locations. [2024-11-28 02:55:34,601 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 02:55:34,711 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-28 02:55:34,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 66 transitions, 160 flow [2024-11-28 02:55:34,831 INFO L124 PetriNetUnfolderBase]: 6/62 cut-off events. [2024-11-28 02:55:34,838 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-28 02:55:34,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 62 events. 6/62 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 156 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2024-11-28 02:55:34,849 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 66 transitions, 160 flow [2024-11-28 02:55:34,853 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 61 transitions, 146 flow [2024-11-28 02:55:34,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:55:34,879 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=None, 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;@648ff3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:55:34,879 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-11-28 02:55:34,885 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 02:55:34,885 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-28 02:55:34,885 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 02:55:34,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:34,886 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-28 02:55:34,887 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-28 02:55:34,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:34,894 INFO L85 PathProgramCache]: Analyzing trace with hash 854427, now seen corresponding path program 1 times [2024-11-28 02:55:34,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:34,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048751310] [2024-11-28 02:55:34,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:34,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:35,248 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-28 02:55:35,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:35,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048751310] [2024-11-28 02:55:35,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048751310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:35,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:55:35,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 02:55:35,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764248628] [2024-11-28 02:55:35,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:35,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:55:35,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:35,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:55:35,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:55:35,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-28 02:55:35,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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-28 02:55:35,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:35,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-28 02:55:35,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:37,569 INFO L124 PetriNetUnfolderBase]: 9651/13134 cut-off events. [2024-11-28 02:55:37,569 INFO L125 PetriNetUnfolderBase]: For 223/223 co-relation queries the response was YES. [2024-11-28 02:55:37,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25668 conditions, 13134 events. 9651/13134 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 82850 event pairs, 6408 based on Foata normal form. 1/7359 useless extension candidates. Maximal degree in co-relation 24078. Up to 11896 conditions per place. [2024-11-28 02:55:37,720 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 36 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2024-11-28 02:55:37,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 214 flow [2024-11-28 02:55:37,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:55:37,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 02:55:37,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-11-28 02:55:37,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5707070707070707 [2024-11-28 02:55:37,740 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 146 flow. Second operand 3 states and 113 transitions. [2024-11-28 02:55:37,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 214 flow [2024-11-28 02:55:37,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 198 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-28 02:55:37,778 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 126 flow [2024-11-28 02:55:37,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2024-11-28 02:55:37,784 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2024-11-28 02:55:37,786 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 126 flow [2024-11-28 02:55:37,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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-28 02:55:37,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:37,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-28 02:55:37,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 02:55:37,788 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-28 02:55:37,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:37,789 INFO L85 PathProgramCache]: Analyzing trace with hash 854428, now seen corresponding path program 1 times [2024-11-28 02:55:37,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:37,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690574525] [2024-11-28 02:55:37,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:37,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:38,243 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-28 02:55:38,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:38,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690574525] [2024-11-28 02:55:38,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690574525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:38,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:55:38,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:55:38,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084671337] [2024-11-28 02:55:38,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:38,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:55:38,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:38,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:55:38,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:55:38,271 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-28 02:55:38,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 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-28 02:55:38,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:38,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-28 02:55:38,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:40,145 INFO L124 PetriNetUnfolderBase]: 9652/13137 cut-off events. [2024-11-28 02:55:40,146 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 02:55:40,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25271 conditions, 13137 events. 9652/13137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 82611 event pairs, 6408 based on Foata normal form. 0/7359 useless extension candidates. Maximal degree in co-relation 25242. Up to 11905 conditions per place. [2024-11-28 02:55:40,246 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 39 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2024-11-28 02:55:40,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 60 transitions, 218 flow [2024-11-28 02:55:40,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:55:40,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 02:55:40,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2024-11-28 02:55:40,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2024-11-28 02:55:40,249 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 126 flow. Second operand 4 states and 140 transitions. [2024-11-28 02:55:40,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 60 transitions, 218 flow [2024-11-28 02:55:40,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 02:55:40,253 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 149 flow [2024-11-28 02:55:40,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2024-11-28 02:55:40,254 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -7 predicate places. [2024-11-28 02:55:40,255 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 149 flow [2024-11-28 02:55:40,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 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-28 02:55:40,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:40,256 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-28 02:55:40,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 02:55:40,257 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-28 02:55:40,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:40,258 INFO L85 PathProgramCache]: Analyzing trace with hash 26488923, now seen corresponding path program 1 times [2024-11-28 02:55:40,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:40,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140445935] [2024-11-28 02:55:40,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:40,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:40,613 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-28 02:55:40,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:40,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140445935] [2024-11-28 02:55:40,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140445935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:40,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:55:40,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:55:40,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892679350] [2024-11-28 02:55:40,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:40,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:55:40,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:40,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:55:40,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:55:40,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-28 02:55:40,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 149 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 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-28 02:55:40,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:40,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-28 02:55:40,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:42,232 INFO L124 PetriNetUnfolderBase]: 9653/13140 cut-off events. [2024-11-28 02:55:42,232 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 02:55:42,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25288 conditions, 13140 events. 9653/13140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 82879 event pairs, 6408 based on Foata normal form. 0/7361 useless extension candidates. Maximal degree in co-relation 25263. Up to 11904 conditions per place. [2024-11-28 02:55:42,317 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 39 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2024-11-28 02:55:42,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 247 flow [2024-11-28 02:55:42,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:55:42,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 02:55:42,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2024-11-28 02:55:42,322 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5060606060606061 [2024-11-28 02:55:42,322 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 149 flow. Second operand 5 states and 167 transitions. [2024-11-28 02:55:42,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 247 flow [2024-11-28 02:55:42,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 02:55:42,324 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 183 flow [2024-11-28 02:55:42,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2024-11-28 02:55:42,327 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2024-11-28 02:55:42,327 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 183 flow [2024-11-28 02:55:42,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 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-28 02:55:42,327 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:42,328 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-11-28 02:55:42,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 02:55:42,328 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-28 02:55:42,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:42,329 INFO L85 PathProgramCache]: Analyzing trace with hash 821133276, now seen corresponding path program 1 times [2024-11-28 02:55:42,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:42,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096371495] [2024-11-28 02:55:42,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:42,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:42,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:42,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:42,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096371495] [2024-11-28 02:55:42,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096371495] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:55:42,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080712096] [2024-11-28 02:55:42,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:42,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:55:42,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:55:42,707 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:55:42,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 02:55:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:42,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-28 02:55:42,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:55:42,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-11-28 02:55:43,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:43,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:55:43,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:43,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080712096] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:55:43,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:55:43,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-11-28 02:55:43,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158418673] [2024-11-28 02:55:43,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:55:43,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 02:55:43,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:43,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 02:55:43,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-28 02:55:43,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-28 02:55:43,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 183 flow. Second operand has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 0 states have call successors, (0), 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-28 02:55:43,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:43,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-28 02:55:43,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:45,453 INFO L124 PetriNetUnfolderBase]: 9653/13139 cut-off events. [2024-11-28 02:55:45,453 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-28 02:55:45,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25301 conditions, 13139 events. 9653/13139 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 82893 event pairs, 6408 based on Foata normal form. 0/7363 useless extension candidates. Maximal degree in co-relation 25273. Up to 11903 conditions per place. [2024-11-28 02:55:45,565 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 37 selfloop transitions, 8 changer transitions 0/62 dead transitions. [2024-11-28 02:55:45,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 62 transitions, 269 flow [2024-11-28 02:55:45,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:55:45,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-28 02:55:45,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 211 transitions. [2024-11-28 02:55:45,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45670995670995673 [2024-11-28 02:55:45,567 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 183 flow. Second operand 7 states and 211 transitions. [2024-11-28 02:55:45,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 62 transitions, 269 flow [2024-11-28 02:55:45,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 62 transitions, 268 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 02:55:45,570 INFO L231 Difference]: Finished difference. Result has 70 places, 62 transitions, 194 flow [2024-11-28 02:55:45,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=194, PETRI_PLACES=70, PETRI_TRANSITIONS=62} [2024-11-28 02:55:45,571 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 2 predicate places. [2024-11-28 02:55:45,571 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 62 transitions, 194 flow [2024-11-28 02:55:45,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 0 states have call successors, (0), 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-28 02:55:45,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:45,572 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2024-11-28 02:55:45,582 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 02:55:45,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:55:45,776 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-28 02:55:45,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:45,777 INFO L85 PathProgramCache]: Analyzing trace with hash -313921946, now seen corresponding path program 1 times [2024-11-28 02:55:45,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:45,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847258758] [2024-11-28 02:55:45,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:45,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:46,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:46,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:46,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847258758] [2024-11-28 02:55:46,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847258758] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:55:46,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640551578] [2024-11-28 02:55:46,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:46,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:55:46,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:55:46,156 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:55:46,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 02:55:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:46,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-28 02:55:46,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:55:46,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 02:55:46,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:46,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:55:46,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:46,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640551578] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:55:46,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:55:46,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2024-11-28 02:55:46,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333933941] [2024-11-28 02:55:46,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:55:46,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 02:55:46,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:46,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 02:55:46,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-28 02:55:46,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-28 02:55:46,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 62 transitions, 194 flow. Second operand has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 0 states have call successors, (0), 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-28 02:55:46,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:46,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-28 02:55:46,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:48,187 INFO L124 PetriNetUnfolderBase]: 9655/13144 cut-off events. [2024-11-28 02:55:48,187 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-28 02:55:48,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25327 conditions, 13144 events. 9655/13144 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 82773 event pairs, 6408 based on Foata normal form. 2/7370 useless extension candidates. Maximal degree in co-relation 25281. Up to 11897 conditions per place. [2024-11-28 02:55:48,301 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 32 selfloop transitions, 18 changer transitions 0/67 dead transitions. [2024-11-28 02:55:48,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 67 transitions, 321 flow [2024-11-28 02:55:48,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 02:55:48,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-28 02:55:48,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 268 transitions. [2024-11-28 02:55:48,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4511784511784512 [2024-11-28 02:55:48,303 INFO L175 Difference]: Start difference. First operand has 70 places, 62 transitions, 194 flow. Second operand 9 states and 268 transitions. [2024-11-28 02:55:48,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 67 transitions, 321 flow [2024-11-28 02:55:48,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 67 transitions, 274 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-11-28 02:55:48,307 INFO L231 Difference]: Finished difference. Result has 68 places, 67 transitions, 210 flow [2024-11-28 02:55:48,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=210, PETRI_PLACES=68, PETRI_TRANSITIONS=67} [2024-11-28 02:55:48,308 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2024-11-28 02:55:48,308 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 67 transitions, 210 flow [2024-11-28 02:55:48,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 0 states have call successors, (0), 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-28 02:55:48,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:48,308 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:48,317 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 02:55:48,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:55:48,513 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-28 02:55:48,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:48,514 INFO L85 PathProgramCache]: Analyzing trace with hash -956672402, now seen corresponding path program 1 times [2024-11-28 02:55:48,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:48,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619589214] [2024-11-28 02:55:48,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:48,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:48,650 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-28 02:55:48,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:48,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619589214] [2024-11-28 02:55:48,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619589214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:48,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:55:48,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:55:48,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079082501] [2024-11-28 02:55:48,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:48,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:55:48,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:48,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:55:48,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:55:48,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2024-11-28 02:55:48,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 67 transitions, 210 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-28 02:55:48,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:48,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2024-11-28 02:55:48,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:49,711 INFO L124 PetriNetUnfolderBase]: 10699/14748 cut-off events. [2024-11-28 02:55:49,711 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-28 02:55:49,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28403 conditions, 14748 events. 10699/14748 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 1122. Compared 96138 event pairs, 7188 based on Foata normal form. 311/8999 useless extension candidates. Maximal degree in co-relation 25266. Up to 11911 conditions per place. [2024-11-28 02:55:49,783 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 78 selfloop transitions, 5 changer transitions 0/100 dead transitions. [2024-11-28 02:55:49,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 100 transitions, 488 flow [2024-11-28 02:55:49,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:55:49,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 02:55:49,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 207 transitions. [2024-11-28 02:55:49,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6272727272727273 [2024-11-28 02:55:49,785 INFO L175 Difference]: Start difference. First operand has 68 places, 67 transitions, 210 flow. Second operand 5 states and 207 transitions. [2024-11-28 02:55:49,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 100 transitions, 488 flow [2024-11-28 02:55:49,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 100 transitions, 435 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-11-28 02:55:49,788 INFO L231 Difference]: Finished difference. Result has 69 places, 69 transitions, 216 flow [2024-11-28 02:55:49,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=69, PETRI_TRANSITIONS=69} [2024-11-28 02:55:49,789 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2024-11-28 02:55:49,789 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 216 flow [2024-11-28 02:55:49,789 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-28 02:55:49,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:49,790 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:49,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 02:55:49,790 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-28 02:55:49,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:49,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1302710318, now seen corresponding path program 1 times [2024-11-28 02:55:49,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:49,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508009303] [2024-11-28 02:55:49,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:49,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:49,972 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 02:55:49,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:49,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508009303] [2024-11-28 02:55:49,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508009303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:49,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:55:49,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:55:49,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578972621] [2024-11-28 02:55:49,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:49,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:55:49,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:49,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:55:49,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:55:49,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-28 02:55:49,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 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-28 02:55:49,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:49,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-28 02:55:49,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:50,676 INFO L124 PetriNetUnfolderBase]: 7342/10482 cut-off events. [2024-11-28 02:55:50,676 INFO L125 PetriNetUnfolderBase]: For 990/990 co-relation queries the response was YES. [2024-11-28 02:55:50,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21999 conditions, 10482 events. 7342/10482 cut-off events. For 990/990 co-relation queries the response was YES. Maximal size of possible extension queue 793. Compared 69657 event pairs, 5000 based on Foata normal form. 0/6429 useless extension candidates. Maximal degree in co-relation 18902. Up to 9263 conditions per place. [2024-11-28 02:55:50,723 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 42 selfloop transitions, 8 changer transitions 0/67 dead transitions. [2024-11-28 02:55:50,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 67 transitions, 308 flow [2024-11-28 02:55:50,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:55:50,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 02:55:50,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2024-11-28 02:55:50,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47878787878787876 [2024-11-28 02:55:50,725 INFO L175 Difference]: Start difference. First operand has 69 places, 69 transitions, 216 flow. Second operand 5 states and 158 transitions. [2024-11-28 02:55:50,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 67 transitions, 308 flow [2024-11-28 02:55:50,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 67 transitions, 303 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 02:55:50,730 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 219 flow [2024-11-28 02:55:50,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=219, PETRI_PLACES=69, PETRI_TRANSITIONS=67} [2024-11-28 02:55:50,733 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2024-11-28 02:55:50,733 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 219 flow [2024-11-28 02:55:50,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 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-28 02:55:50,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:50,735 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:50,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 02:55:50,736 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-28 02:55:50,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:50,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1302710319, now seen corresponding path program 1 times [2024-11-28 02:55:50,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:50,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838543992] [2024-11-28 02:55:50,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:50,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:51,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:55:51,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:51,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838543992] [2024-11-28 02:55:51,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838543992] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:55:51,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935127920] [2024-11-28 02:55:51,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:51,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:55:51,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:55:51,014 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:55:51,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 02:55:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:51,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-28 02:55:51,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:55:51,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:55:51,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:55:51,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-28 02:55:51,214 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:55:51,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2024-11-28 02:55:51,260 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:55:51,260 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:55:51,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935127920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:51,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 02:55:51,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2024-11-28 02:55:51,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304730018] [2024-11-28 02:55:51,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:51,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:55:51,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:51,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:55:51,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:55:51,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-28 02:55:51,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 219 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 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-28 02:55:51,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:51,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-28 02:55:51,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:51,904 INFO L124 PetriNetUnfolderBase]: 4700/7088 cut-off events. [2024-11-28 02:55:51,905 INFO L125 PetriNetUnfolderBase]: For 779/779 co-relation queries the response was YES. [2024-11-28 02:55:51,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14118 conditions, 7088 events. 4700/7088 cut-off events. For 779/779 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 47478 event pairs, 3256 based on Foata normal form. 0/5137 useless extension candidates. Maximal degree in co-relation 10966. Up to 6052 conditions per place. [2024-11-28 02:55:51,951 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 44 selfloop transitions, 4 changer transitions 0/65 dead transitions. [2024-11-28 02:55:51,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 65 transitions, 307 flow [2024-11-28 02:55:51,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:55:51,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 02:55:51,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2024-11-28 02:55:51,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-28 02:55:51,953 INFO L175 Difference]: Start difference. First operand has 69 places, 67 transitions, 219 flow. Second operand 4 states and 132 transitions. [2024-11-28 02:55:51,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 65 transitions, 307 flow [2024-11-28 02:55:51,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 65 transitions, 295 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-28 02:55:51,957 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 207 flow [2024-11-28 02:55:51,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=207, PETRI_PLACES=67, PETRI_TRANSITIONS=65} [2024-11-28 02:55:51,959 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2024-11-28 02:55:51,959 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 207 flow [2024-11-28 02:55:51,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 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-28 02:55:51,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:51,959 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:51,968 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 02:55:52,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:55:52,164 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-28 02:55:52,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:52,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1547564026, now seen corresponding path program 1 times [2024-11-28 02:55:52,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:52,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300136506] [2024-11-28 02:55:52,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:52,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:52,240 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-28 02:55:52,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:52,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300136506] [2024-11-28 02:55:52,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300136506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:52,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:55:52,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:55:52,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304408084] [2024-11-28 02:55:52,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:52,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:55:52,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:52,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:55:52,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:55:52,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-28 02:55:52,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 207 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 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-28 02:55:52,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:52,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-28 02:55:52,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:52,751 INFO L124 PetriNetUnfolderBase]: 3157/4788 cut-off events. [2024-11-28 02:55:52,751 INFO L125 PetriNetUnfolderBase]: For 545/545 co-relation queries the response was YES. [2024-11-28 02:55:52,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9613 conditions, 4788 events. 3157/4788 cut-off events. For 545/545 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 30817 event pairs, 2196 based on Foata normal form. 0/3596 useless extension candidates. Maximal degree in co-relation 7451. Up to 4089 conditions per place. [2024-11-28 02:55:52,775 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 41 selfloop transitions, 5 changer transitions 0/63 dead transitions. [2024-11-28 02:55:52,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 63 transitions, 295 flow [2024-11-28 02:55:52,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:55:52,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 02:55:52,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2024-11-28 02:55:52,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49242424242424243 [2024-11-28 02:55:52,776 INFO L175 Difference]: Start difference. First operand has 67 places, 65 transitions, 207 flow. Second operand 4 states and 130 transitions. [2024-11-28 02:55:52,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 63 transitions, 295 flow [2024-11-28 02:55:52,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 63 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 02:55:52,779 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 208 flow [2024-11-28 02:55:52,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2024-11-28 02:55:52,781 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2024-11-28 02:55:52,781 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 208 flow [2024-11-28 02:55:52,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 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-28 02:55:52,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:52,782 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:52,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 02:55:52,782 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-28 02:55:52,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:52,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1547564025, now seen corresponding path program 1 times [2024-11-28 02:55:52,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:52,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879508913] [2024-11-28 02:55:52,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:52,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:52,895 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-28 02:55:52,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:52,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879508913] [2024-11-28 02:55:52,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879508913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:52,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:55:52,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:55:52,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208155547] [2024-11-28 02:55:52,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:52,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:55:52,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:52,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:55:52,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:55:52,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2024-11-28 02:55:52,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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-28 02:55:52,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:52,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2024-11-28 02:55:52,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:53,395 INFO L124 PetriNetUnfolderBase]: 3672/5904 cut-off events. [2024-11-28 02:55:53,396 INFO L125 PetriNetUnfolderBase]: For 683/683 co-relation queries the response was YES. [2024-11-28 02:55:53,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11700 conditions, 5904 events. 3672/5904 cut-off events. For 683/683 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 41381 event pairs, 2627 based on Foata normal form. 134/4946 useless extension candidates. Maximal degree in co-relation 9122. Up to 4102 conditions per place. [2024-11-28 02:55:53,419 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 59 selfloop transitions, 7 changer transitions 0/83 dead transitions. [2024-11-28 02:55:53,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 83 transitions, 392 flow [2024-11-28 02:55:53,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:55:53,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 02:55:53,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2024-11-28 02:55:53,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6174242424242424 [2024-11-28 02:55:53,420 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 208 flow. Second operand 4 states and 163 transitions. [2024-11-28 02:55:53,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 83 transitions, 392 flow [2024-11-28 02:55:53,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 83 transitions, 386 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 02:55:53,424 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 226 flow [2024-11-28 02:55:53,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2024-11-28 02:55:53,424 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2024-11-28 02:55:53,424 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 226 flow [2024-11-28 02:55:53,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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-28 02:55:53,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:53,425 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:53,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 02:55:53,425 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-28 02:55:53,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:53,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1502991826, now seen corresponding path program 1 times [2024-11-28 02:55:53,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:53,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393068654] [2024-11-28 02:55:53,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:53,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:53,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:55:53,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:53,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393068654] [2024-11-28 02:55:53,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393068654] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:55:53,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719425390] [2024-11-28 02:55:53,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:53,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:55:53,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:55:53,638 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:55:53,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 02:55:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:53,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-28 02:55:53,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:55:53,837 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-28 02:55:53,837 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:55:53,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719425390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:53,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 02:55:53,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-11-28 02:55:53,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747504843] [2024-11-28 02:55:53,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:53,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:55:53,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:53,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:55:53,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:55:53,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2024-11-28 02:55:53,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 226 flow. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 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-28 02:55:53,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:53,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2024-11-28 02:55:53,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:54,223 INFO L124 PetriNetUnfolderBase]: 2432/4125 cut-off events. [2024-11-28 02:55:54,224 INFO L125 PetriNetUnfolderBase]: For 957/957 co-relation queries the response was YES. [2024-11-28 02:55:54,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8602 conditions, 4125 events. 2432/4125 cut-off events. For 957/957 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 28893 event pairs, 1773 based on Foata normal form. 0/3634 useless extension candidates. Maximal degree in co-relation 6648. Up to 3294 conditions per place. [2024-11-28 02:55:54,238 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 37 selfloop transitions, 7 changer transitions 0/61 dead transitions. [2024-11-28 02:55:54,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 61 transitions, 306 flow [2024-11-28 02:55:54,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:55:54,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 02:55:54,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2024-11-28 02:55:54,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2024-11-28 02:55:54,240 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 226 flow. Second operand 4 states and 136 transitions. [2024-11-28 02:55:54,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 61 transitions, 306 flow [2024-11-28 02:55:54,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 61 transitions, 301 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 02:55:54,242 INFO L231 Difference]: Finished difference. Result has 68 places, 61 transitions, 227 flow [2024-11-28 02:55:54,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=227, PETRI_PLACES=68, PETRI_TRANSITIONS=61} [2024-11-28 02:55:54,243 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2024-11-28 02:55:54,243 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 61 transitions, 227 flow [2024-11-28 02:55:54,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 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-28 02:55:54,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:54,243 INFO L206 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-28 02:55:54,252 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 02:55:54,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-28 02:55:54,443 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-28 02:55:54,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:54,444 INFO L85 PathProgramCache]: Analyzing trace with hash -583952937, now seen corresponding path program 1 times [2024-11-28 02:55:54,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:54,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689369069] [2024-11-28 02:55:54,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:54,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:54,494 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-28 02:55:54,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:54,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689369069] [2024-11-28 02:55:54,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689369069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:54,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:55:54,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:55:54,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537980288] [2024-11-28 02:55:54,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:54,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:55:54,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:54,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:55:54,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:55:54,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2024-11-28 02:55:54,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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-28 02:55:54,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:54,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2024-11-28 02:55:54,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:55,097 INFO L124 PetriNetUnfolderBase]: 3680/6033 cut-off events. [2024-11-28 02:55:55,098 INFO L125 PetriNetUnfolderBase]: For 1502/1502 co-relation queries the response was YES. [2024-11-28 02:55:55,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12694 conditions, 6033 events. 3680/6033 cut-off events. For 1502/1502 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 40707 event pairs, 1008 based on Foata normal form. 4/5667 useless extension candidates. Maximal degree in co-relation 10215. Up to 2879 conditions per place. [2024-11-28 02:55:55,121 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 56 selfloop transitions, 3 changer transitions 2/78 dead transitions. [2024-11-28 02:55:55,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 78 transitions, 396 flow [2024-11-28 02:55:55,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:55:55,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 02:55:55,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2024-11-28 02:55:55,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2024-11-28 02:55:55,123 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 227 flow. Second operand 3 states and 126 transitions. [2024-11-28 02:55:55,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 78 transitions, 396 flow [2024-11-28 02:55:55,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 78 transitions, 386 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 02:55:55,125 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 226 flow [2024-11-28 02:55:55,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2024-11-28 02:55:55,126 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2024-11-28 02:55:55,126 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 226 flow [2024-11-28 02:55:55,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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-28 02:55:55,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:55,126 INFO L206 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] [2024-11-28 02:55:55,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 02:55:55,126 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-28 02:55:55,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:55,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1861360907, now seen corresponding path program 1 times [2024-11-28 02:55:55,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:55,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856186504] [2024-11-28 02:55:55,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:55,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:55,260 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 02:55:55,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:55,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856186504] [2024-11-28 02:55:55,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856186504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:55,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:55:55,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:55:55,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148317793] [2024-11-28 02:55:55,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:55,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:55:55,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:55,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:55:55,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:55:55,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2024-11-28 02:55:55,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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-28 02:55:55,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:55,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2024-11-28 02:55:55,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:55,884 INFO L124 PetriNetUnfolderBase]: 3518/5566 cut-off events. [2024-11-28 02:55:55,884 INFO L125 PetriNetUnfolderBase]: For 3037/3037 co-relation queries the response was YES. [2024-11-28 02:55:55,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12971 conditions, 5566 events. 3518/5566 cut-off events. For 3037/3037 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 35872 event pairs, 1121 based on Foata normal form. 106/5318 useless extension candidates. Maximal degree in co-relation 10844. Up to 2974 conditions per place. [2024-11-28 02:55:55,917 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 64 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2024-11-28 02:55:55,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 83 transitions, 422 flow [2024-11-28 02:55:55,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:55:55,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 02:55:55,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2024-11-28 02:55:55,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2024-11-28 02:55:55,919 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 226 flow. Second operand 3 states and 129 transitions. [2024-11-28 02:55:55,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 83 transitions, 422 flow [2024-11-28 02:55:55,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 83 transitions, 418 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 02:55:55,923 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 239 flow [2024-11-28 02:55:55,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=239, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2024-11-28 02:55:55,923 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2024-11-28 02:55:55,923 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 239 flow [2024-11-28 02:55:55,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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-28 02:55:55,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:55,924 INFO L206 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] [2024-11-28 02:55:55,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 02:55:55,924 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-28 02:55:55,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:55,924 INFO L85 PathProgramCache]: Analyzing trace with hash 979003430, now seen corresponding path program 1 times [2024-11-28 02:55:55,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:55,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416418737] [2024-11-28 02:55:55,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:55,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:56,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:55:56,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:56,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416418737] [2024-11-28 02:55:56,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416418737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:56,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:55:56,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:55:56,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819668448] [2024-11-28 02:55:56,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:56,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:55:56,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:56,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:55:56,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:55:56,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2024-11-28 02:55:56,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 239 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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-28 02:55:56,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:56,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2024-11-28 02:55:56,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:56,598 INFO L124 PetriNetUnfolderBase]: 3440/5710 cut-off events. [2024-11-28 02:55:56,598 INFO L125 PetriNetUnfolderBase]: For 4625/4625 co-relation queries the response was YES. [2024-11-28 02:55:56,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13564 conditions, 5710 events. 3440/5710 cut-off events. For 4625/4625 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 39328 event pairs, 1181 based on Foata normal form. 44/5460 useless extension candidates. Maximal degree in co-relation 11546. Up to 2919 conditions per place. [2024-11-28 02:55:56,619 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 64 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2024-11-28 02:55:56,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 83 transitions, 442 flow [2024-11-28 02:55:56,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:55:56,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 02:55:56,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2024-11-28 02:55:56,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6414141414141414 [2024-11-28 02:55:56,620 INFO L175 Difference]: Start difference. First operand has 71 places, 63 transitions, 239 flow. Second operand 3 states and 127 transitions. [2024-11-28 02:55:56,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 83 transitions, 442 flow [2024-11-28 02:55:56,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 83 transitions, 427 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-28 02:55:56,624 INFO L231 Difference]: Finished difference. Result has 73 places, 64 transitions, 247 flow [2024-11-28 02:55:56,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=247, PETRI_PLACES=73, PETRI_TRANSITIONS=64} [2024-11-28 02:55:56,625 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2024-11-28 02:55:56,625 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 64 transitions, 247 flow [2024-11-28 02:55:56,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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-28 02:55:56,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:56,625 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:56,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 02:55:56,625 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-28 02:55:56,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:56,626 INFO L85 PathProgramCache]: Analyzing trace with hash -257826715, now seen corresponding path program 1 times [2024-11-28 02:55:56,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:56,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929703341] [2024-11-28 02:55:56,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:56,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:56,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 02:55:56,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:56,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929703341] [2024-11-28 02:55:56,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929703341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:56,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:55:56,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:55:56,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133618220] [2024-11-28 02:55:56,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:56,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:55:56,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:56,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:55:56,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:55:57,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66 [2024-11-28 02:55:57,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 64 transitions, 247 flow. Second operand has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 0 states have call successors, (0), 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-28 02:55:57,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:57,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66 [2024-11-28 02:55:57,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:58,122 INFO L124 PetriNetUnfolderBase]: 9623/14191 cut-off events. [2024-11-28 02:55:58,122 INFO L125 PetriNetUnfolderBase]: For 8571/8571 co-relation queries the response was YES. [2024-11-28 02:55:58,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34153 conditions, 14191 events. 9623/14191 cut-off events. For 8571/8571 co-relation queries the response was YES. Maximal size of possible extension queue 766. Compared 93633 event pairs, 836 based on Foata normal form. 0/13247 useless extension candidates. Maximal degree in co-relation 28463. Up to 10041 conditions per place. [2024-11-28 02:55:58,172 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 96 selfloop transitions, 7 changer transitions 19/134 dead transitions. [2024-11-28 02:55:58,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 134 transitions, 713 flow [2024-11-28 02:55:58,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:55:58,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 02:55:58,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 228 transitions. [2024-11-28 02:55:58,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2024-11-28 02:55:58,174 INFO L175 Difference]: Start difference. First operand has 73 places, 64 transitions, 247 flow. Second operand 6 states and 228 transitions. [2024-11-28 02:55:58,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 134 transitions, 713 flow [2024-11-28 02:55:58,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 134 transitions, 690 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-11-28 02:55:58,179 INFO L231 Difference]: Finished difference. Result has 81 places, 70 transitions, 286 flow [2024-11-28 02:55:58,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=286, PETRI_PLACES=81, PETRI_TRANSITIONS=70} [2024-11-28 02:55:58,179 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 13 predicate places. [2024-11-28 02:55:58,180 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 70 transitions, 286 flow [2024-11-28 02:55:58,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 0 states have call successors, (0), 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-28 02:55:58,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:58,180 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:58,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 02:55:58,180 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-28 02:55:58,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:58,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1780923429, now seen corresponding path program 2 times [2024-11-28 02:55:58,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:58,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530377684] [2024-11-28 02:55:58,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:55:58,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:58,207 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:55:58,207 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:55:58,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 02:55:58,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:58,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530377684] [2024-11-28 02:55:58,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530377684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:58,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:55:58,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:55:58,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220446411] [2024-11-28 02:55:58,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:58,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:55:58,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:58,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:55:58,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:55:58,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66 [2024-11-28 02:55:58,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 70 transitions, 286 flow. Second operand has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 0 states have call successors, (0), 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-28 02:55:58,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:58,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66 [2024-11-28 02:55:58,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:56:00,554 INFO L124 PetriNetUnfolderBase]: 12298/17906 cut-off events. [2024-11-28 02:56:00,555 INFO L125 PetriNetUnfolderBase]: For 12388/12391 co-relation queries the response was YES. [2024-11-28 02:56:00,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47483 conditions, 17906 events. 12298/17906 cut-off events. For 12388/12391 co-relation queries the response was YES. Maximal size of possible extension queue 975. Compared 119885 event pairs, 962 based on Foata normal form. 306/18042 useless extension candidates. Maximal degree in co-relation 40300. Up to 7499 conditions per place. [2024-11-28 02:56:00,630 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 158 selfloop transitions, 23 changer transitions 5/198 dead transitions. [2024-11-28 02:56:00,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 198 transitions, 1133 flow [2024-11-28 02:56:00,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 02:56:00,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-28 02:56:00,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 338 transitions. [2024-11-28 02:56:00,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.569023569023569 [2024-11-28 02:56:00,633 INFO L175 Difference]: Start difference. First operand has 81 places, 70 transitions, 286 flow. Second operand 9 states and 338 transitions. [2024-11-28 02:56:00,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 198 transitions, 1133 flow [2024-11-28 02:56:00,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 198 transitions, 1123 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-11-28 02:56:00,642 INFO L231 Difference]: Finished difference. Result has 94 places, 87 transitions, 459 flow [2024-11-28 02:56:00,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=459, PETRI_PLACES=94, PETRI_TRANSITIONS=87} [2024-11-28 02:56:00,642 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 26 predicate places. [2024-11-28 02:56:00,642 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 87 transitions, 459 flow [2024-11-28 02:56:00,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 0 states have call successors, (0), 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-28 02:56:00,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:56:00,643 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:56:00,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 02:56:00,643 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-28 02:56:00,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:56:00,643 INFO L85 PathProgramCache]: Analyzing trace with hash 631706759, now seen corresponding path program 3 times [2024-11-28 02:56:00,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:56:00,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587092978] [2024-11-28 02:56:00,643 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 02:56:00,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:56:00,667 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-28 02:56:00,667 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:56:01,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 02:56:01,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:56:01,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587092978] [2024-11-28 02:56:01,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587092978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:56:01,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:56:01,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:56:01,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678602135] [2024-11-28 02:56:01,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:56:01,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:56:01,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:56:01,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:56:01,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:56:01,121 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66 [2024-11-28 02:56:01,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 87 transitions, 459 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 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-28 02:56:01,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:56:01,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66 [2024-11-28 02:56:01,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:56:03,252 INFO L124 PetriNetUnfolderBase]: 15997/23186 cut-off events. [2024-11-28 02:56:03,252 INFO L125 PetriNetUnfolderBase]: For 30719/30719 co-relation queries the response was YES. [2024-11-28 02:56:03,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71886 conditions, 23186 events. 15997/23186 cut-off events. For 30719/30719 co-relation queries the response was YES. Maximal size of possible extension queue 1328. Compared 161094 event pairs, 1982 based on Foata normal form. 114/23085 useless extension candidates. Maximal degree in co-relation 60260. Up to 8687 conditions per place. [2024-11-28 02:56:03,377 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 166 selfloop transitions, 31 changer transitions 4/213 dead transitions. [2024-11-28 02:56:03,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 213 transitions, 1406 flow [2024-11-28 02:56:03,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:56:03,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-28 02:56:03,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 309 transitions. [2024-11-28 02:56:03,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5852272727272727 [2024-11-28 02:56:03,378 INFO L175 Difference]: Start difference. First operand has 94 places, 87 transitions, 459 flow. Second operand 8 states and 309 transitions. [2024-11-28 02:56:03,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 213 transitions, 1406 flow [2024-11-28 02:56:03,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 213 transitions, 1402 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-11-28 02:56:03,450 INFO L231 Difference]: Finished difference. Result has 106 places, 104 transitions, 707 flow [2024-11-28 02:56:03,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=707, PETRI_PLACES=106, PETRI_TRANSITIONS=104} [2024-11-28 02:56:03,451 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 38 predicate places. [2024-11-28 02:56:03,451 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 104 transitions, 707 flow [2024-11-28 02:56:03,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 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-28 02:56:03,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:56:03,451 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:56:03,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 02:56:03,451 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-28 02:56:03,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:56:03,452 INFO L85 PathProgramCache]: Analyzing trace with hash -975583171, now seen corresponding path program 4 times [2024-11-28 02:56:03,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:56:03,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597399613] [2024-11-28 02:56:03,452 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 02:56:03,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:56:03,491 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 02:56:03,491 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:56:03,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:56:03,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:56:03,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597399613] [2024-11-28 02:56:03,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597399613] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:56:03,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100377812] [2024-11-28 02:56:03,976 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 02:56:03,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:56:03,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:56:03,980 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:56:03,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 02:56:04,099 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 02:56:04,099 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:56:04,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-28 02:56:04,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:56:04,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 02:56:04,487 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:56:04,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100377812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:56:04,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 02:56:04,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-11-28 02:56:04,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592671031] [2024-11-28 02:56:04,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:56:04,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:56:04,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:56:04,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:56:04,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-28 02:56:04,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66 [2024-11-28 02:56:04,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 104 transitions, 707 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 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-28 02:56:04,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:56:04,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66 [2024-11-28 02:56:04,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:56:07,393 INFO L124 PetriNetUnfolderBase]: 17305/25558 cut-off events. [2024-11-28 02:56:07,393 INFO L125 PetriNetUnfolderBase]: For 55029/55134 co-relation queries the response was YES. [2024-11-28 02:56:07,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87534 conditions, 25558 events. 17305/25558 cut-off events. For 55029/55134 co-relation queries the response was YES. Maximal size of possible extension queue 1479. Compared 184616 event pairs, 3089 based on Foata normal form. 114/25121 useless extension candidates. Maximal degree in co-relation 81607. Up to 10063 conditions per place. [2024-11-28 02:56:07,519 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 147 selfloop transitions, 36 changer transitions 3/198 dead transitions. [2024-11-28 02:56:07,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 198 transitions, 1494 flow [2024-11-28 02:56:07,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:56:07,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-28 02:56:07,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 269 transitions. [2024-11-28 02:56:07,521 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5822510822510822 [2024-11-28 02:56:07,521 INFO L175 Difference]: Start difference. First operand has 106 places, 104 transitions, 707 flow. Second operand 7 states and 269 transitions. [2024-11-28 02:56:07,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 198 transitions, 1494 flow [2024-11-28 02:56:07,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 198 transitions, 1472 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-28 02:56:07,878 INFO L231 Difference]: Finished difference. Result has 114 places, 110 transitions, 871 flow [2024-11-28 02:56:07,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=871, PETRI_PLACES=114, PETRI_TRANSITIONS=110} [2024-11-28 02:56:07,879 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 46 predicate places. [2024-11-28 02:56:07,879 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 110 transitions, 871 flow [2024-11-28 02:56:07,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 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-28 02:56:07,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:56:07,879 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:56:07,885 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 02:56:08,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09acccb9-a4bf-4b10-9f1d-663cb1671311/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-28 02:56:08,080 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-28 02:56:08,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:56:08,080 INFO L85 PathProgramCache]: Analyzing trace with hash -7042677, now seen corresponding path program 5 times [2024-11-28 02:56:08,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:56:08,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808703000] [2024-11-28 02:56:08,080 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 02:56:08,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:56:08,123 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:56:08,124 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:56:08,484 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-28 02:56:08,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:56:08,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808703000] [2024-11-28 02:56:08,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808703000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:56:08,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:56:08,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:56:08,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946315520] [2024-11-28 02:56:08,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:56:08,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:56:08,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:56:08,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:56:08,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:56:08,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 66 [2024-11-28 02:56:08,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 110 transitions, 871 flow. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 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-28 02:56:08,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:56:08,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 66 [2024-11-28 02:56:08,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:56:11,844 INFO L124 PetriNetUnfolderBase]: 21173/29964 cut-off events. [2024-11-28 02:56:11,844 INFO L125 PetriNetUnfolderBase]: For 79335/79335 co-relation queries the response was YES. [2024-11-28 02:56:11,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108290 conditions, 29964 events. 21173/29964 cut-off events. For 79335/79335 co-relation queries the response was YES. Maximal size of possible extension queue 1713. Compared 205250 event pairs, 3313 based on Foata normal form. 86/29784 useless extension candidates. Maximal degree in co-relation 101842. Up to 23233 conditions per place. [2024-11-28 02:56:12,007 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 136 selfloop transitions, 22 changer transitions 9/178 dead transitions. [2024-11-28 02:56:12,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 178 transitions, 1473 flow [2024-11-28 02:56:12,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:56:12,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 02:56:12,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 228 transitions. [2024-11-28 02:56:12,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2024-11-28 02:56:12,009 INFO L175 Difference]: Start difference. First operand has 114 places, 110 transitions, 871 flow. Second operand 6 states and 228 transitions. [2024-11-28 02:56:12,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 178 transitions, 1473 flow [2024-11-28 02:56:12,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 178 transitions, 1438 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-11-28 02:56:12,814 INFO L231 Difference]: Finished difference. Result has 119 places, 114 transitions, 931 flow [2024-11-28 02:56:12,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=825, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=931, PETRI_PLACES=119, PETRI_TRANSITIONS=114} [2024-11-28 02:56:12,815 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 51 predicate places. [2024-11-28 02:56:12,815 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 114 transitions, 931 flow [2024-11-28 02:56:12,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 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-28 02:56:12,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:56:12,815 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:56:12,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 02:56:12,816 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-28 02:56:12,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:56:12,816 INFO L85 PathProgramCache]: Analyzing trace with hash 2097460917, now seen corresponding path program 6 times [2024-11-28 02:56:12,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:56:12,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589613218] [2024-11-28 02:56:12,816 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-28 02:56:12,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:56:12,845 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-11-28 02:56:12,846 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:56:13,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 02:56:13,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:56:13,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589613218] [2024-11-28 02:56:13,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589613218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:56:13,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:56:13,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:56:13,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193820224] [2024-11-28 02:56:13,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:56:13,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:56:13,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:56:13,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:56:13,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:56:13,128 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66 [2024-11-28 02:56:13,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 114 transitions, 931 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 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-28 02:56:13,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:56:13,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66 [2024-11-28 02:56:13,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:56:19,540 INFO L124 PetriNetUnfolderBase]: 32566/49595 cut-off events. [2024-11-28 02:56:19,541 INFO L125 PetriNetUnfolderBase]: For 159600/160708 co-relation queries the response was YES. [2024-11-28 02:56:19,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172125 conditions, 49595 events. 32566/49595 cut-off events. For 159600/160708 co-relation queries the response was YES. Maximal size of possible extension queue 2703. Compared 402034 event pairs, 4259 based on Foata normal form. 1191/50011 useless extension candidates. Maximal degree in co-relation 157794. Up to 13684 conditions per place. [2024-11-28 02:56:19,839 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 241 selfloop transitions, 61 changer transitions 4/329 dead transitions. [2024-11-28 02:56:19,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 329 transitions, 3280 flow [2024-11-28 02:56:19,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 02:56:19,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-28 02:56:19,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 351 transitions. [2024-11-28 02:56:19,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2024-11-28 02:56:19,841 INFO L175 Difference]: Start difference. First operand has 119 places, 114 transitions, 931 flow. Second operand 9 states and 351 transitions. [2024-11-28 02:56:19,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 329 transitions, 3280 flow [2024-11-28 02:56:21,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 329 transitions, 3215 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-11-28 02:56:21,019 INFO L231 Difference]: Finished difference. Result has 131 places, 160 transitions, 1690 flow [2024-11-28 02:56:21,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1690, PETRI_PLACES=131, PETRI_TRANSITIONS=160} [2024-11-28 02:56:21,020 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 63 predicate places. [2024-11-28 02:56:21,020 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 160 transitions, 1690 flow [2024-11-28 02:56:21,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 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-28 02:56:21,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:56:21,020 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:56:21,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 02:56:21,020 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-28 02:56:21,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:56:21,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1017132077, now seen corresponding path program 7 times [2024-11-28 02:56:21,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:56:21,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429299869] [2024-11-28 02:56:21,021 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-28 02:56:21,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:56:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:56:21,385 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-28 02:56:21,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:56:21,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429299869] [2024-11-28 02:56:21,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429299869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:56:21,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:56:21,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:56:21,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419787612] [2024-11-28 02:56:21,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:56:21,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:56:21,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:56:21,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:56:21,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:56:21,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2024-11-28 02:56:21,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 160 transitions, 1690 flow. Second operand has 7 states, 7 states have (on average 27.0) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 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-28 02:56:21,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:56:21,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2024-11-28 02:56:21,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:56:30,674 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([867] L51-->L56: Formula: (let ((.cse1 (* v_~q1_back~0_110 4))) (let ((.cse0 (+ .cse1 v_~q1~0.offset_115))) (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~q1~0.base_121) .cse0) v_~C~0_106) 1 0) 0)) (<= 0 .cse0) (= 1 (select |v_#valid_208| v_~q1~0.base_121)) (<= (+ .cse1 v_~q1~0.offset_115 4) (select |v_#length_197| v_~q1~0.base_121)) (= (+ v_~q1_back~0_110 1) v_~q1_back~0_109) (not (= (ite (and (<= 0 v_~q1_back~0_110) (< v_~q1_back~0_110 v_~n1~0_96)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_110, ~C~0=v_~C~0_106, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, #memory_int#1=|v_#memory_int#1_73|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_109, ~C~0=v_~C~0_106, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][284], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), 20#L119true, Black: 506#(<= ~N~0 ~j~0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 195#(<= ~n1~0 0), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 26#L145-4true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 16#L56true, Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 520#true]) [2024-11-28 02:56:30,675 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-28 02:56:30,675 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 02:56:30,675 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 02:56:30,675 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-28 02:56:30,676 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([864] L62-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_5| 256) 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][89], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), 20#L119true, Black: 506#(<= ~N~0 ~j~0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 195#(<= ~n1~0 0), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 26#L145-4true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 293#(= ~total~0 0), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 43#thread1EXITtrue, 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 520#true]) [2024-11-28 02:56:30,676 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-28 02:56:30,676 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 02:56:30,676 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 02:56:30,676 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-28 02:56:30,677 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{~j~0=v_~j~0_12, thread2Thread1of1ForFork3_#t~post6#1=|v_thread2Thread1of1ForFork3_#t~post6#1_1|} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork3_#t~post6#1][308], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), 20#L119true, Black: 506#(<= ~N~0 ~j~0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 195#(<= ~n1~0 0), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 8#L62true, 26#L145-4true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 520#true, 55#L80true]) [2024-11-28 02:56:30,677 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-28 02:56:30,677 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 02:56:30,677 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-28 02:56:30,677 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 02:56:30,763 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([867] L51-->L56: Formula: (let ((.cse1 (* v_~q1_back~0_110 4))) (let ((.cse0 (+ .cse1 v_~q1~0.offset_115))) (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~q1~0.base_121) .cse0) v_~C~0_106) 1 0) 0)) (<= 0 .cse0) (= 1 (select |v_#valid_208| v_~q1~0.base_121)) (<= (+ .cse1 v_~q1~0.offset_115 4) (select |v_#length_197| v_~q1~0.base_121)) (= (+ v_~q1_back~0_110 1) v_~q1_back~0_109) (not (= (ite (and (<= 0 v_~q1_back~0_110) (< v_~q1_back~0_110 v_~n1~0_96)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_110, ~C~0=v_~C~0_106, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, #memory_int#1=|v_#memory_int#1_73|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_109, ~C~0=v_~C~0_106, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][410], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 61#L116true, 244#(= (select |#valid| ~q2~0.base) 1), 45#L98true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 26#L145-4true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 16#L56true, Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 38#L77true, 526#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0))]) [2024-11-28 02:56:30,763 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-28 02:56:30,763 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 02:56:30,763 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 02:56:30,764 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-28 02:56:30,764 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([864] L62-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_5| 256) 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][236], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 61#L116true, 244#(= (select |#valid| ~q2~0.base) 1), 45#L98true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 26#L145-4true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 43#thread1EXITtrue, 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 38#L77true, 526#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0))]) [2024-11-28 02:56:30,764 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-28 02:56:30,764 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 02:56:30,764 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 02:56:30,764 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-28 02:56:30,764 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{~j~0=v_~j~0_12, thread2Thread1of1ForFork3_#t~post6#1=|v_thread2Thread1of1ForFork3_#t~post6#1_1|} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork3_#t~post6#1][411], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 61#L116true, 244#(= (select |#valid| ~q2~0.base) 1), 45#L98true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 8#L62true, 26#L145-4true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 526#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 55#L80true]) [2024-11-28 02:56:30,764 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-28 02:56:30,764 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 02:56:30,764 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 02:56:30,764 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-28 02:56:30,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([867] L51-->L56: Formula: (let ((.cse1 (* v_~q1_back~0_110 4))) (let ((.cse0 (+ .cse1 v_~q1~0.offset_115))) (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~q1~0.base_121) .cse0) v_~C~0_106) 1 0) 0)) (<= 0 .cse0) (= 1 (select |v_#valid_208| v_~q1~0.base_121)) (<= (+ .cse1 v_~q1~0.offset_115 4) (select |v_#length_197| v_~q1~0.base_121)) (= (+ v_~q1_back~0_110 1) v_~q1_back~0_109) (not (= (ite (and (<= 0 v_~q1_back~0_110) (< v_~q1_back~0_110 v_~n1~0_96)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_110, ~C~0=v_~C~0_106, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, #memory_int#1=|v_#memory_int#1_73|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_109, ~C~0=v_~C~0_106, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][284], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), 20#L119true, Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 22#L146true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 293#(= ~total~0 0), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 16#L56true, Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 520#true]) [2024-11-28 02:56:30,873 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-28 02:56:30,873 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 02:56:30,873 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 02:56:30,873 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-28 02:56:30,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([864] L62-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_5| 256) 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][89], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), 20#L119true, Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 22#L146true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), 43#thread1EXITtrue, Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 520#true]) [2024-11-28 02:56:30,873 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-28 02:56:30,873 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 02:56:30,873 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 02:56:30,873 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-28 02:56:30,874 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{~j~0=v_~j~0_12, thread2Thread1of1ForFork3_#t~post6#1=|v_thread2Thread1of1ForFork3_#t~post6#1_1|} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork3_#t~post6#1][308], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), 20#L119true, Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 22#L146true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 8#L62true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 293#(= ~total~0 0), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 520#true, 55#L80true]) [2024-11-28 02:56:30,874 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-28 02:56:30,874 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 02:56:30,874 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-28 02:56:30,874 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 02:56:30,897 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([867] L51-->L56: Formula: (let ((.cse1 (* v_~q1_back~0_110 4))) (let ((.cse0 (+ .cse1 v_~q1~0.offset_115))) (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~q1~0.base_121) .cse0) v_~C~0_106) 1 0) 0)) (<= 0 .cse0) (= 1 (select |v_#valid_208| v_~q1~0.base_121)) (<= (+ .cse1 v_~q1~0.offset_115 4) (select |v_#length_197| v_~q1~0.base_121)) (= (+ v_~q1_back~0_110 1) v_~q1_back~0_109) (not (= (ite (and (<= 0 v_~q1_back~0_110) (< v_~q1_back~0_110 v_~n1~0_96)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_110, ~C~0=v_~C~0_106, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, #memory_int#1=|v_#memory_int#1_73|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_109, ~C~0=v_~C~0_106, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][284], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 195#(<= ~n1~0 0), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 26#L145-4true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 16#L56true, Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), 41#L111true, Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 520#true]) [2024-11-28 02:56:30,898 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-28 02:56:30,898 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 02:56:30,898 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 02:56:30,898 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-28 02:56:30,898 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([864] L62-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_5| 256) 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][89], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 195#(<= ~n1~0 0), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 26#L145-4true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 293#(= ~total~0 0), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), 41#L111true, Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 43#thread1EXITtrue, 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 520#true]) [2024-11-28 02:56:30,898 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-28 02:56:30,898 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-28 02:56:30,898 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 02:56:30,898 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 02:56:30,898 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{~j~0=v_~j~0_12, thread2Thread1of1ForFork3_#t~post6#1=|v_thread2Thread1of1ForFork3_#t~post6#1_1|} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork3_#t~post6#1][308], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 195#(<= ~n1~0 0), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 8#L62true, 26#L145-4true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), 41#L111true, Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 55#L80true, 520#true]) [2024-11-28 02:56:30,898 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-28 02:56:30,898 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 02:56:30,898 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-28 02:56:30,899 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 02:56:30,899 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([867] L51-->L56: Formula: (let ((.cse1 (* v_~q1_back~0_110 4))) (let ((.cse0 (+ .cse1 v_~q1~0.offset_115))) (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~q1~0.base_121) .cse0) v_~C~0_106) 1 0) 0)) (<= 0 .cse0) (= 1 (select |v_#valid_208| v_~q1~0.base_121)) (<= (+ .cse1 v_~q1~0.offset_115 4) (select |v_#length_197| v_~q1~0.base_121)) (= (+ v_~q1_back~0_110 1) v_~q1_back~0_109) (not (= (ite (and (<= 0 v_~q1_back~0_110) (< v_~q1_back~0_110 v_~n1~0_96)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_110, ~C~0=v_~C~0_106, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, #memory_int#1=|v_#memory_int#1_73|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_109, ~C~0=v_~C~0_106, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][284], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 195#(<= ~n1~0 0), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 7#thread4EXITtrue, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 26#L145-4true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 16#L56true, Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 520#true]) [2024-11-28 02:56:30,899 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-28 02:56:30,899 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 02:56:30,899 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-28 02:56:30,899 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 02:56:30,899 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([864] L62-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_5| 256) 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][89], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 195#(<= ~n1~0 0), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 7#thread4EXITtrue, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 26#L145-4true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 293#(= ~total~0 0), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 43#thread1EXITtrue, 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 520#true]) [2024-11-28 02:56:30,899 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-28 02:56:30,899 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 02:56:30,899 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 02:56:30,899 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-28 02:56:30,900 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{~j~0=v_~j~0_12, thread2Thread1of1ForFork3_#t~post6#1=|v_thread2Thread1of1ForFork3_#t~post6#1_1|} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork3_#t~post6#1][308], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 195#(<= ~n1~0 0), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 7#thread4EXITtrue, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 8#L62true, 26#L145-4true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 55#L80true, 520#true]) [2024-11-28 02:56:30,900 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-28 02:56:30,900 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 02:56:30,900 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 02:56:30,900 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-28 02:56:30,932 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([867] L51-->L56: Formula: (let ((.cse1 (* v_~q1_back~0_110 4))) (let ((.cse0 (+ .cse1 v_~q1~0.offset_115))) (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~q1~0.base_121) .cse0) v_~C~0_106) 1 0) 0)) (<= 0 .cse0) (= 1 (select |v_#valid_208| v_~q1~0.base_121)) (<= (+ .cse1 v_~q1~0.offset_115 4) (select |v_#length_197| v_~q1~0.base_121)) (= (+ v_~q1_back~0_110 1) v_~q1_back~0_109) (not (= (ite (and (<= 0 v_~q1_back~0_110) (< v_~q1_back~0_110 v_~n1~0_96)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_110, ~C~0=v_~C~0_106, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, #memory_int#1=|v_#memory_int#1_73|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_109, ~C~0=v_~C~0_106, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][410], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 61#L116true, 244#(= (select |#valid| ~q2~0.base) 1), 22#L146true, 45#L98true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 16#L56true, Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 301#(= ~q2_back~0 ~q2_front~0), 203#(= (select |#valid| ~q1~0.base) 1), 38#L77true, 526#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0))]) [2024-11-28 02:56:30,932 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-28 02:56:30,932 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 02:56:30,932 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 02:56:30,932 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-28 02:56:30,932 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([864] L62-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_5| 256) 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][236], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 61#L116true, 244#(= (select |#valid| ~q2~0.base) 1), 22#L146true, 45#L98true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 43#thread1EXITtrue, Black: 301#(= ~q2_back~0 ~q2_front~0), 203#(= (select |#valid| ~q1~0.base) 1), 38#L77true, 526#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0))]) [2024-11-28 02:56:30,932 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-28 02:56:30,932 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 02:56:30,932 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 02:56:30,932 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-28 02:56:30,933 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{~j~0=v_~j~0_12, thread2Thread1of1ForFork3_#t~post6#1=|v_thread2Thread1of1ForFork3_#t~post6#1_1|} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork3_#t~post6#1][411], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 61#L116true, 244#(= (select |#valid| ~q2~0.base) 1), 22#L146true, 45#L98true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 8#L62true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 301#(= ~q2_back~0 ~q2_front~0), 203#(= (select |#valid| ~q1~0.base) 1), 526#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 55#L80true]) [2024-11-28 02:56:30,933 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-28 02:56:30,933 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 02:56:30,933 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 02:56:30,933 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-28 02:56:30,994 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([867] L51-->L56: Formula: (let ((.cse1 (* v_~q1_back~0_110 4))) (let ((.cse0 (+ .cse1 v_~q1~0.offset_115))) (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~q1~0.base_121) .cse0) v_~C~0_106) 1 0) 0)) (<= 0 .cse0) (= 1 (select |v_#valid_208| v_~q1~0.base_121)) (<= (+ .cse1 v_~q1~0.offset_115 4) (select |v_#length_197| v_~q1~0.base_121)) (= (+ v_~q1_back~0_110 1) v_~q1_back~0_109) (not (= (ite (and (<= 0 v_~q1_back~0_110) (< v_~q1_back~0_110 v_~n1~0_96)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_110, ~C~0=v_~C~0_106, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, #memory_int#1=|v_#memory_int#1_73|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_109, ~C~0=v_~C~0_106, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][284], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 22#L146true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 293#(= ~total~0 0), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 16#L56true, Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 41#L111true, Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 520#true]) [2024-11-28 02:56:30,994 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-11-28 02:56:30,994 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-28 02:56:30,994 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-28 02:56:30,994 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-28 02:56:30,994 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([864] L62-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_5| 256) 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][89], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 22#L146true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 41#L111true, Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), 43#thread1EXITtrue, Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 520#true]) [2024-11-28 02:56:30,994 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-28 02:56:30,994 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 02:56:30,995 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 02:56:30,995 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-28 02:56:30,995 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{~j~0=v_~j~0_12, thread2Thread1of1ForFork3_#t~post6#1=|v_thread2Thread1of1ForFork3_#t~post6#1_1|} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork3_#t~post6#1][308], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 22#L146true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 8#L62true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 293#(= ~total~0 0), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 41#L111true, Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 55#L80true, 520#true]) [2024-11-28 02:56:30,995 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-28 02:56:30,995 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 02:56:30,995 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 02:56:30,995 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-28 02:56:30,995 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([867] L51-->L56: Formula: (let ((.cse1 (* v_~q1_back~0_110 4))) (let ((.cse0 (+ .cse1 v_~q1~0.offset_115))) (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~q1~0.base_121) .cse0) v_~C~0_106) 1 0) 0)) (<= 0 .cse0) (= 1 (select |v_#valid_208| v_~q1~0.base_121)) (<= (+ .cse1 v_~q1~0.offset_115 4) (select |v_#length_197| v_~q1~0.base_121)) (= (+ v_~q1_back~0_110 1) v_~q1_back~0_109) (not (= (ite (and (<= 0 v_~q1_back~0_110) (< v_~q1_back~0_110 v_~n1~0_96)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_110, ~C~0=v_~C~0_106, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, #memory_int#1=|v_#memory_int#1_73|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_109, ~C~0=v_~C~0_106, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][284], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 7#thread4EXITtrue, 22#L146true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 293#(= ~total~0 0), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 16#L56true, Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 520#true]) [2024-11-28 02:56:30,995 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-11-28 02:56:30,996 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-28 02:56:30,996 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-28 02:56:30,996 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-28 02:56:30,996 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([864] L62-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_5| 256) 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][89], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 7#thread4EXITtrue, 22#L146true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 293#(= ~total~0 0), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), 43#thread1EXITtrue, Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 520#true]) [2024-11-28 02:56:30,996 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-28 02:56:30,996 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 02:56:30,996 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-28 02:56:30,996 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 02:56:30,996 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{~j~0=v_~j~0_12, thread2Thread1of1ForFork3_#t~post6#1=|v_thread2Thread1of1ForFork3_#t~post6#1_1|} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork3_#t~post6#1][308], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 244#(= (select |#valid| ~q2~0.base) 1), 7#thread4EXITtrue, 22#L146true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 8#L62true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 293#(= ~total~0 0), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 55#L80true, 520#true]) [2024-11-28 02:56:30,996 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-28 02:56:30,996 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 02:56:30,996 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-28 02:56:30,996 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 02:56:31,007 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([867] L51-->L56: Formula: (let ((.cse1 (* v_~q1_back~0_110 4))) (let ((.cse0 (+ .cse1 v_~q1~0.offset_115))) (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~q1~0.base_121) .cse0) v_~C~0_106) 1 0) 0)) (<= 0 .cse0) (= 1 (select |v_#valid_208| v_~q1~0.base_121)) (<= (+ .cse1 v_~q1~0.offset_115 4) (select |v_#length_197| v_~q1~0.base_121)) (= (+ v_~q1_back~0_110 1) v_~q1_back~0_109) (not (= (ite (and (<= 0 v_~q1_back~0_110) (< v_~q1_back~0_110 v_~n1~0_96)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_110, ~C~0=v_~C~0_106, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, #memory_int#1=|v_#memory_int#1_73|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_109, ~C~0=v_~C~0_106, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][410], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 61#L116true, 244#(= (select |#valid| ~q2~0.base) 1), 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 26#L145-4true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 16#L56true, Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, 526#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0))]) [2024-11-28 02:56:31,008 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-11-28 02:56:31,008 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 02:56:31,008 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-28 02:56:31,008 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 02:56:31,008 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([864] L62-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_5| 256) 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][236], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 61#L116true, 244#(= (select |#valid| ~q2~0.base) 1), 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 26#L145-4true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), 43#thread1EXITtrue, Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, 526#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0))]) [2024-11-28 02:56:31,008 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-28 02:56:31,008 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-28 02:56:31,008 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 02:56:31,009 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 02:56:31,009 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{~j~0=v_~j~0_12, thread2Thread1of1ForFork3_#t~post6#1=|v_thread2Thread1of1ForFork3_#t~post6#1_1|} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork3_#t~post6#1][411], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 61#L116true, 244#(= (select |#valid| ~q2~0.base) 1), 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 8#L62true, 26#L145-4true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 526#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 55#L80true]) [2024-11-28 02:56:31,009 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-28 02:56:31,009 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-28 02:56:31,009 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 02:56:31,009 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 02:56:31,312 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([867] L51-->L56: Formula: (let ((.cse1 (* v_~q1_back~0_110 4))) (let ((.cse0 (+ .cse1 v_~q1~0.offset_115))) (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~q1~0.base_121) .cse0) v_~C~0_106) 1 0) 0)) (<= 0 .cse0) (= 1 (select |v_#valid_208| v_~q1~0.base_121)) (<= (+ .cse1 v_~q1~0.offset_115 4) (select |v_#length_197| v_~q1~0.base_121)) (= (+ v_~q1_back~0_110 1) v_~q1_back~0_109) (not (= (ite (and (<= 0 v_~q1_back~0_110) (< v_~q1_back~0_110 v_~n1~0_96)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_110, ~C~0=v_~C~0_106, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, #memory_int#1=|v_#memory_int#1_73|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~q1~0.offset=v_~q1~0.offset_115, ~q1_back~0=v_~q1_back~0_109, ~C~0=v_~C~0_106, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_121, #valid=|v_#valid_208|, #length=|v_#length_197|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][410], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 61#L116true, 244#(= (select |#valid| ~q2~0.base) 1), 22#L146true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 16#L56true, Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, 526#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0))]) [2024-11-28 02:56:31,312 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-28 02:56:31,312 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 02:56:31,312 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-28 02:56:31,312 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 02:56:31,312 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([864] L62-->thread1EXIT: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_5| 256) 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_5|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][236], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 61#L116true, 244#(= (select |#valid| ~q2~0.base) 1), 22#L146true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 43#thread1EXITtrue, 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 38#L77true, 526#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0))]) [2024-11-28 02:56:31,312 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-11-28 02:56:31,312 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 02:56:31,313 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 02:56:31,313 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-28 02:56:31,313 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{~j~0=v_~j~0_12, thread2Thread1of1ForFork3_#t~post6#1=|v_thread2Thread1of1ForFork3_#t~post6#1_1|} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork3_#t~post6#1][411], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 195#(<= ~n1~0 0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 61#L116true, 244#(= (select |#valid| ~q2~0.base) 1), 22#L146true, 318#true, 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 502#true, 8#L62true, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 293#(= ~total~0 0), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 301#(= ~q2_back~0 ~q2_front~0), 10#thread3EXITtrue, 526#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 303#true, Black: 248#(<= ~n2~0 0), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 55#L80true]) [2024-11-28 02:56:31,313 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-11-28 02:56:31,313 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 02:56:31,313 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 02:56:31,313 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-28 02:56:31,347 INFO L124 PetriNetUnfolderBase]: 49029/71374 cut-off events. [2024-11-28 02:56:31,347 INFO L125 PetriNetUnfolderBase]: For 292752/297525 co-relation queries the response was YES. [2024-11-28 02:56:31,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267376 conditions, 71374 events. 49029/71374 cut-off events. For 292752/297525 co-relation queries the response was YES. Maximal size of possible extension queue 4012. Compared 566027 event pairs, 10164 based on Foata normal form. 2812/68605 useless extension candidates. Maximal degree in co-relation 243769. Up to 28158 conditions per place. [2024-11-28 02:56:31,953 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 368 selfloop transitions, 39 changer transitions 4/454 dead transitions. [2024-11-28 02:56:31,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 454 transitions, 5725 flow [2024-11-28 02:56:31,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 02:56:31,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-28 02:56:31,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 337 transitions. [2024-11-28 02:56:31,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5673400673400674 [2024-11-28 02:56:31,955 INFO L175 Difference]: Start difference. First operand has 131 places, 160 transitions, 1690 flow. Second operand 9 states and 337 transitions. [2024-11-28 02:56:31,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 454 transitions, 5725 flow [2024-11-28 02:56:35,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 454 transitions, 5719 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-11-28 02:56:35,702 INFO L231 Difference]: Finished difference. Result has 144 places, 206 transitions, 2374 flow [2024-11-28 02:56:35,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1684, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2374, PETRI_PLACES=144, PETRI_TRANSITIONS=206} [2024-11-28 02:56:35,702 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 76 predicate places. [2024-11-28 02:56:35,702 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 206 transitions, 2374 flow [2024-11-28 02:56:35,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 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-28 02:56:35,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:56:35,703 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:56:35,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 02:56:35,703 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-28 02:56:35,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:56:35,703 INFO L85 PathProgramCache]: Analyzing trace with hash -253429441, now seen corresponding path program 8 times [2024-11-28 02:56:35,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:56:35,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263829732] [2024-11-28 02:56:35,703 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:56:35,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:56:35,725 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:56:35,725 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:56:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 02:56:35,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:56:35,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263829732] [2024-11-28 02:56:35,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263829732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:56:35,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:56:35,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:56:35,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577907814] [2024-11-28 02:56:35,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:56:35,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:56:35,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:56:35,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:56:35,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:56:36,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66 [2024-11-28 02:56:36,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 206 transitions, 2374 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 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-28 02:56:36,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:56:36,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66 [2024-11-28 02:56:36,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:56:47,114 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([893] L111-->L116: Formula: (let ((.cse2 (* v_~q2_front~0_126 4))) (let ((.cse1 (<= 0 (+ |v_thread4Thread1of1ForFork2_plus_#res#1_1| 2147483648))) (.cse3 (<= |v_thread4Thread1of1ForFork2_plus_#res#1_1| 2147483647)) (.cse0 (+ v_~q2~0.offset_111 .cse2))) (and (= (+ v_~total~0_110 (select (select |v_#memory_int#1_67| v_~q2~0.base_115) .cse0)) |v_thread4Thread1of1ForFork2_plus_#res#1_1|) (not (= (ite (or .cse1 (<= v_~total~0_110 |v_thread4Thread1of1ForFork2_plus_#res#1_1|)) 1 0) 0)) (<= (+ v_~q2~0.offset_111 .cse2 4) (select |v_#length_185| v_~q2~0.base_115)) (= (select |v_#valid_196| v_~q2~0.base_115) 1) .cse1 .cse3 (= (+ v_~q2_front~0_126 1) v_~q2_front~0_125) (not (= (ite (or (<= |v_thread4Thread1of1ForFork2_plus_#res#1_1| v_~total~0_110) .cse3) 1 0) 0)) (<= 0 .cse0) (= v_~total~0_109 |v_thread4Thread1of1ForFork2_plus_#res#1_1|) (not (= (ite (and (< v_~q2_front~0_126 v_~q2_back~0_113) (< v_~q2_front~0_126 v_~n2~0_90) (<= 0 v_~q2_front~0_126)) 1 0) 0))))) InVars {~n2~0=v_~n2~0_90, ~q2~0.offset=v_~q2~0.offset_111, #valid=|v_#valid_196|, ~q2_front~0=v_~q2_front~0_126, ~q2~0.base=v_~q2~0.base_115, #length=|v_#length_185|, #memory_int#1=|v_#memory_int#1_67|, ~q2_back~0=v_~q2_back~0_113, ~total~0=v_~total~0_110} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_90, ~q2~0.offset=v_~q2~0.offset_111, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_125, thread4Thread1of1ForFork2_#t~ret11#1=|v_thread4Thread1of1ForFork2_#t~ret11#1_1|, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_1|, #memory_int#1=|v_#memory_int#1_67|, thread4Thread1of1ForFork2_#t~mem10#1=|v_thread4Thread1of1ForFork2_#t~mem10#1_1|, ~total~0=v_~total~0_109, thread4Thread1of1ForFork2_#t~post12#1=|v_thread4Thread1of1ForFork2_#t~post12#1_1|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_1|, #valid=|v_#valid_196|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_1|, ~q2~0.base=v_~q2~0.base_115, #length=|v_#length_185|, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_1|, ~q2_back~0=v_~q2_back~0_113} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post12#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_#t~ret11#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~mem10#1, ~total~0][442], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 526#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 534#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 525#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), 244#(= (select |#valid| ~q2~0.base) 1), Black: 528#(and (or (and (= |thread4Thread1of1ForFork2_~cond~3#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread4Thread1of1ForFork2_~cond~3#1| 1))) (= ~q2_back~0 ~q2_front~0)), Black: 532#(and (<= (+ ~j~0 1) ~N~0) (= |thread4Thread1of1ForFork2_~cond~3#1| 1)), 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 26#L145-4true, Black: 293#(= ~total~0 0), 16#L56true, Black: 297#(= ~q1_back~0 ~q1_front~0), 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), 52#L83true, Black: 301#(= ~q2_back~0 ~q2_front~0), 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), 303#true, 509#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))) (<= ~i~0 ~j~0)), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 549#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 195#(<= ~n1~0 0), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), 61#L116true, Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 35#L101true, Black: 248#(<= ~n2~0 0), 520#true]) [2024-11-28 02:56:47,114 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-28 02:56:47,114 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 02:56:47,114 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 02:56:47,114 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 02:56:47,114 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([890] L119-->thread4EXIT: Formula: (and (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_5| 256) 0) (= |v_thread4Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread4Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_5|} OutVars{thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_1|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_1|, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_5|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork2_#res#1.offset][124], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 526#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 534#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 244#(= (select |#valid| ~q2~0.base) 1), Black: 525#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 528#(and (or (and (= |thread4Thread1of1ForFork2_~cond~3#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread4Thread1of1ForFork2_~cond~3#1| 1))) (= ~q2_back~0 ~q2_front~0)), Black: 532#(and (<= (+ ~j~0 1) ~N~0) (= |thread4Thread1of1ForFork2_~cond~3#1| 1)), 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 26#L145-4true, Black: 293#(= ~total~0 0), 16#L56true, Black: 297#(= ~q1_back~0 ~q1_front~0), 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), 52#L83true, Black: 301#(= ~q2_back~0 ~q2_front~0), 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), 303#true, 509#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))) (<= ~i~0 ~j~0)), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 549#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 195#(<= ~n1~0 0), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 7#thread4EXITtrue, 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 35#L101true, Black: 248#(<= ~n2~0 0), 520#true]) [2024-11-28 02:56:47,114 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-28 02:56:47,115 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 02:56:47,115 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 02:56:47,115 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 02:56:47,988 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([893] L111-->L116: Formula: (let ((.cse2 (* v_~q2_front~0_126 4))) (let ((.cse1 (<= 0 (+ |v_thread4Thread1of1ForFork2_plus_#res#1_1| 2147483648))) (.cse3 (<= |v_thread4Thread1of1ForFork2_plus_#res#1_1| 2147483647)) (.cse0 (+ v_~q2~0.offset_111 .cse2))) (and (= (+ v_~total~0_110 (select (select |v_#memory_int#1_67| v_~q2~0.base_115) .cse0)) |v_thread4Thread1of1ForFork2_plus_#res#1_1|) (not (= (ite (or .cse1 (<= v_~total~0_110 |v_thread4Thread1of1ForFork2_plus_#res#1_1|)) 1 0) 0)) (<= (+ v_~q2~0.offset_111 .cse2 4) (select |v_#length_185| v_~q2~0.base_115)) (= (select |v_#valid_196| v_~q2~0.base_115) 1) .cse1 .cse3 (= (+ v_~q2_front~0_126 1) v_~q2_front~0_125) (not (= (ite (or (<= |v_thread4Thread1of1ForFork2_plus_#res#1_1| v_~total~0_110) .cse3) 1 0) 0)) (<= 0 .cse0) (= v_~total~0_109 |v_thread4Thread1of1ForFork2_plus_#res#1_1|) (not (= (ite (and (< v_~q2_front~0_126 v_~q2_back~0_113) (< v_~q2_front~0_126 v_~n2~0_90) (<= 0 v_~q2_front~0_126)) 1 0) 0))))) InVars {~n2~0=v_~n2~0_90, ~q2~0.offset=v_~q2~0.offset_111, #valid=|v_#valid_196|, ~q2_front~0=v_~q2_front~0_126, ~q2~0.base=v_~q2~0.base_115, #length=|v_#length_185|, #memory_int#1=|v_#memory_int#1_67|, ~q2_back~0=v_~q2_back~0_113, ~total~0=v_~total~0_110} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_90, ~q2~0.offset=v_~q2~0.offset_111, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_125, thread4Thread1of1ForFork2_#t~ret11#1=|v_thread4Thread1of1ForFork2_#t~ret11#1_1|, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_1|, #memory_int#1=|v_#memory_int#1_67|, thread4Thread1of1ForFork2_#t~mem10#1=|v_thread4Thread1of1ForFork2_#t~mem10#1_1|, ~total~0=v_~total~0_109, thread4Thread1of1ForFork2_#t~post12#1=|v_thread4Thread1of1ForFork2_#t~post12#1_1|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_1|, #valid=|v_#valid_196|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_1|, ~q2~0.base=v_~q2~0.base_115, #length=|v_#length_185|, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_1|, ~q2_back~0=v_~q2_back~0_113} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post12#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_#t~ret11#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~mem10#1, ~total~0][544], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 526#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 534#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 244#(= (select |#valid| ~q2~0.base) 1), Black: 525#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 528#(and (or (and (= |thread4Thread1of1ForFork2_~cond~3#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread4Thread1of1ForFork2_~cond~3#1| 1))) (= ~q2_back~0 ~q2_front~0)), Black: 532#(and (<= (+ ~j~0 1) ~N~0) (= |thread4Thread1of1ForFork2_~cond~3#1| 1)), 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 26#L145-4true, Black: 293#(= ~total~0 0), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 301#(= ~q2_back~0 ~q2_front~0), 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), 303#true, Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 543#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 195#(<= ~n1~0 0), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), 61#L116true, Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 37#L59true, Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 35#L101true, Black: 248#(<= ~n2~0 0), 55#L80true, 520#true]) [2024-11-28 02:56:47,988 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-28 02:56:47,988 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 02:56:47,988 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 02:56:47,988 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 02:56:47,988 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([890] L119-->thread4EXIT: Formula: (and (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_5| 256) 0) (= |v_thread4Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread4Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_5|} OutVars{thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_1|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_1|, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_5|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork2_#res#1.offset][233], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 526#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 534#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 244#(= (select |#valid| ~q2~0.base) 1), Black: 525#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 528#(and (or (and (= |thread4Thread1of1ForFork2_~cond~3#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread4Thread1of1ForFork2_~cond~3#1| 1))) (= ~q2_back~0 ~q2_front~0)), Black: 532#(and (<= (+ ~j~0 1) ~N~0) (= |thread4Thread1of1ForFork2_~cond~3#1| 1)), 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 26#L145-4true, Black: 293#(= ~total~0 0), Black: 297#(= ~q1_back~0 ~q1_front~0), Black: 301#(= ~q2_back~0 ~q2_front~0), 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), 303#true, Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 543#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 195#(<= ~n1~0 0), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), Black: 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), 7#thread4EXITtrue, Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 37#L59true, Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 35#L101true, Black: 248#(<= ~n2~0 0), 55#L80true, 520#true]) [2024-11-28 02:56:47,988 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-28 02:56:47,988 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 02:56:47,988 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 02:56:47,988 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 02:56:48,048 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([893] L111-->L116: Formula: (let ((.cse2 (* v_~q2_front~0_126 4))) (let ((.cse1 (<= 0 (+ |v_thread4Thread1of1ForFork2_plus_#res#1_1| 2147483648))) (.cse3 (<= |v_thread4Thread1of1ForFork2_plus_#res#1_1| 2147483647)) (.cse0 (+ v_~q2~0.offset_111 .cse2))) (and (= (+ v_~total~0_110 (select (select |v_#memory_int#1_67| v_~q2~0.base_115) .cse0)) |v_thread4Thread1of1ForFork2_plus_#res#1_1|) (not (= (ite (or .cse1 (<= v_~total~0_110 |v_thread4Thread1of1ForFork2_plus_#res#1_1|)) 1 0) 0)) (<= (+ v_~q2~0.offset_111 .cse2 4) (select |v_#length_185| v_~q2~0.base_115)) (= (select |v_#valid_196| v_~q2~0.base_115) 1) .cse1 .cse3 (= (+ v_~q2_front~0_126 1) v_~q2_front~0_125) (not (= (ite (or (<= |v_thread4Thread1of1ForFork2_plus_#res#1_1| v_~total~0_110) .cse3) 1 0) 0)) (<= 0 .cse0) (= v_~total~0_109 |v_thread4Thread1of1ForFork2_plus_#res#1_1|) (not (= (ite (and (< v_~q2_front~0_126 v_~q2_back~0_113) (< v_~q2_front~0_126 v_~n2~0_90) (<= 0 v_~q2_front~0_126)) 1 0) 0))))) InVars {~n2~0=v_~n2~0_90, ~q2~0.offset=v_~q2~0.offset_111, #valid=|v_#valid_196|, ~q2_front~0=v_~q2_front~0_126, ~q2~0.base=v_~q2~0.base_115, #length=|v_#length_185|, #memory_int#1=|v_#memory_int#1_67|, ~q2_back~0=v_~q2_back~0_113, ~total~0=v_~total~0_110} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_90, ~q2~0.offset=v_~q2~0.offset_111, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_125, thread4Thread1of1ForFork2_#t~ret11#1=|v_thread4Thread1of1ForFork2_#t~ret11#1_1|, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_1|, #memory_int#1=|v_#memory_int#1_67|, thread4Thread1of1ForFork2_#t~mem10#1=|v_thread4Thread1of1ForFork2_#t~mem10#1_1|, ~total~0=v_~total~0_109, thread4Thread1of1ForFork2_#t~post12#1=|v_thread4Thread1of1ForFork2_#t~post12#1_1|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_1|, #valid=|v_#valid_196|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_1|, ~q2~0.base=v_~q2~0.base_115, #length=|v_#length_185|, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_1|, ~q2_back~0=v_~q2_back~0_113} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post12#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_#t~ret11#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~mem10#1, ~total~0][442], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 526#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 534#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 525#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), 244#(= (select |#valid| ~q2~0.base) 1), Black: 528#(and (or (and (= |thread4Thread1of1ForFork2_~cond~3#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread4Thread1of1ForFork2_~cond~3#1| 1))) (= ~q2_back~0 ~q2_front~0)), Black: 532#(and (<= (+ ~j~0 1) ~N~0) (= |thread4Thread1of1ForFork2_~cond~3#1| 1)), 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 26#L145-4true, Black: 293#(= ~total~0 0), 16#L56true, Black: 297#(= ~q1_back~0 ~q1_front~0), 52#L83true, Black: 301#(= ~q2_back~0 ~q2_front~0), 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), 303#true, 509#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))) (<= ~i~0 ~j~0)), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 549#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 195#(<= ~n1~0 0), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), 61#L116true, 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 35#L101true, Black: 248#(<= ~n2~0 0), 520#true]) [2024-11-28 02:56:48,048 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-28 02:56:48,048 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 02:56:48,048 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 02:56:48,048 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 02:56:48,049 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([890] L119-->thread4EXIT: Formula: (and (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_5| 256) 0) (= |v_thread4Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread4Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_5|} OutVars{thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_1|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_1|, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_5|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork2_#res#1.offset][124], [139#(<= ~n2~0 2147483647), Black: 504#(<= ~i~0 ~j~0), Black: 511#(and (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 513#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0)), Black: 506#(<= ~N~0 ~j~0), Black: 507#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 505#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))), Black: 526#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 534#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 244#(= (select |#valid| ~q2~0.base) 1), Black: 525#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 528#(and (or (and (= |thread4Thread1of1ForFork2_~cond~3#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread4Thread1of1ForFork2_~cond~3#1| 1))) (= ~q2_back~0 ~q2_front~0)), Black: 532#(and (<= (+ ~j~0 1) ~N~0) (= |thread4Thread1of1ForFork2_~cond~3#1| 1)), 272#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 26#L145-4true, Black: 293#(= ~total~0 0), 16#L56true, Black: 297#(= ~q1_back~0 ~q1_front~0), 52#L83true, Black: 301#(= ~q2_back~0 ~q2_front~0), 400#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), 303#true, 509#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))) (<= ~i~0 ~j~0)), Black: 305#(and (= ~j~0 0) (= ~i~0 0)), Black: 306#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), 549#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 (+ ~j~0 1))) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 195#(<= ~n1~0 0), Black: 197#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 326#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0)), Black: 324#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 334#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 225#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 332#(and (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 328#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0)), Black: 320#(<= ~i~0 ~j~0), 351#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 7#thread4EXITtrue, 330#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~i~0 ~j~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 353#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 347#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 349#(and (<= ~i~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 355#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 487#(and (<= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (<= 0 ~j~0) (<= ~N~0 0)), Black: 372#(and (<= ~i~0 0) (<= 0 ~j~0)), Black: 422#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0) (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 203#(= (select |#valid| ~q1~0.base) 1), Black: 495#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 499#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (< 0 ~N~0))), 35#L101true, Black: 248#(<= ~n2~0 0), 520#true]) [2024-11-28 02:56:48,049 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-28 02:56:48,049 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 02:56:48,049 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 02:56:48,049 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event