./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_190e472e-c956-4dcc-8968-ae32bb7ba90f/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_190e472e-c956-4dcc-8968-ae32bb7ba90f/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_190e472e-c956-4dcc-8968-ae32bb7ba90f/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_190e472e-c956-4dcc-8968-ae32bb7ba90f/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_190e472e-c956-4dcc-8968-ae32bb7ba90f/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_190e472e-c956-4dcc-8968-ae32bb7ba90f/bin/uautomizer-verify-LYvppIcaGC --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dbff9cba9b3794b18d55ca52c1abf6279404a7b220f91d79730a04b586f9ee44 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 01:57:12,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 01:57:12,172 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_190e472e-c956-4dcc-8968-ae32bb7ba90f/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-24 01:57:12,177 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 01:57:12,178 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 01:57:12,202 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 01:57:12,202 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 01:57:12,203 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 01:57:12,203 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 01:57:12,203 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 01:57:12,203 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 01:57:12,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 01:57:12,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 01:57:12,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 01:57:12,204 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 01:57:12,204 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 01:57:12,204 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 01:57:12,205 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 01:57:12,205 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 01:57:12,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 01:57:12,205 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 01:57:12,205 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 01:57:12,205 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 01:57:12,205 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 01:57:12,206 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 01:57:12,206 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 01:57:12,206 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 01:57:12,206 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 01:57:12,206 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 01:57:12,206 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:57:12,206 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:57:12,207 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:57:12,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:57:12,207 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 01:57:12,207 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:57:12,207 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:57:12,207 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:57:12,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:57:12,207 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 01:57:12,208 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 01:57:12,208 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 01:57:12,208 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 01:57:12,208 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 01:57:12,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 01:57:12,208 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 01:57:12,208 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 01:57:12,208 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 01:57:12,208 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 01:57:12,208 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_190e472e-c956-4dcc-8968-ae32bb7ba90f/bin/uautomizer-verify-LYvppIcaGC Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dbff9cba9b3794b18d55ca52c1abf6279404a7b220f91d79730a04b586f9ee44 [2024-11-24 01:57:12,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 01:57:12,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 01:57:12,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 01:57:12,624 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 01:57:12,628 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 01:57:12,629 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_190e472e-c956-4dcc-8968-ae32bb7ba90f/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c [2024-11-24 01:57:16,027 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_190e472e-c956-4dcc-8968-ae32bb7ba90f/bin/uautomizer-verify-LYvppIcaGC/data/66135b321/8d14b7bf6fd447608de958f9d592198c/FLAG528387118 [2024-11-24 01:57:16,368 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 01:57:16,370 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_190e472e-c956-4dcc-8968-ae32bb7ba90f/sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c [2024-11-24 01:57:16,383 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_190e472e-c956-4dcc-8968-ae32bb7ba90f/bin/uautomizer-verify-LYvppIcaGC/data/66135b321/8d14b7bf6fd447608de958f9d592198c/FLAG528387118 [2024-11-24 01:57:16,410 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_190e472e-c956-4dcc-8968-ae32bb7ba90f/bin/uautomizer-verify-LYvppIcaGC/data/66135b321/8d14b7bf6fd447608de958f9d592198c [2024-11-24 01:57:16,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 01:57:16,416 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 01:57:16,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 01:57:16,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 01:57:16,424 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 01:57:16,425 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:57:16" (1/1) ... [2024-11-24 01:57:16,426 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b9e14a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:57:16, skipping insertion in model container [2024-11-24 01:57:16,429 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:57:16" (1/1) ... [2024-11-24 01:57:16,455 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 01:57:16,715 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_190e472e-c956-4dcc-8968-ae32bb7ba90f/sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c[4151,4164] [2024-11-24 01:57:16,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:57:16,752 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 01:57:16,797 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_190e472e-c956-4dcc-8968-ae32bb7ba90f/sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c[4151,4164] [2024-11-24 01:57:16,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:57:16,831 INFO L204 MainTranslator]: Completed translation [2024-11-24 01:57:16,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:57:16 WrapperNode [2024-11-24 01:57:16,832 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 01:57:16,833 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 01:57:16,833 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 01:57:16,834 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 01:57:16,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:57:16" (1/1) ... [2024-11-24 01:57:16,856 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:57:16" (1/1) ... [2024-11-24 01:57:16,888 INFO L138 Inliner]: procedures = 26, calls = 56, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 286 [2024-11-24 01:57:16,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 01:57:16,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 01:57:16,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 01:57:16,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 01:57:16,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:57:16" (1/1) ... [2024-11-24 01:57:16,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:57:16" (1/1) ... [2024-11-24 01:57:16,901 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:57:16" (1/1) ... [2024-11-24 01:57:16,918 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-24 01:57:16,919 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:57:16" (1/1) ... [2024-11-24 01:57:16,919 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:57:16" (1/1) ... [2024-11-24 01:57:16,928 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:57:16" (1/1) ... [2024-11-24 01:57:16,930 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:57:16" (1/1) ... [2024-11-24 01:57:16,934 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:57:16" (1/1) ... [2024-11-24 01:57:16,936 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:57:16" (1/1) ... [2024-11-24 01:57:16,938 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:57:16" (1/1) ... [2024-11-24 01:57:16,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 01:57:16,942 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 01:57:16,942 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 01:57:16,943 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 01:57:16,944 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:57:16" (1/1) ... [2024-11-24 01:57:16,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:57:16,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_190e472e-c956-4dcc-8968-ae32bb7ba90f/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:57:16,986 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_190e472e-c956-4dcc-8968-ae32bb7ba90f/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 01:57:16,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_190e472e-c956-4dcc-8968-ae32bb7ba90f/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 01:57:17,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 01:57:17,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-24 01:57:17,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-24 01:57:17,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-24 01:57:17,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-24 01:57:17,025 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-24 01:57:17,025 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-24 01:57:17,025 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-24 01:57:17,026 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-24 01:57:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-24 01:57:17,026 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-24 01:57:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-24 01:57:17,026 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-24 01:57:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-24 01:57:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-24 01:57:17,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-24 01:57:17,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-24 01:57:17,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-24 01:57:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 01:57:17,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 01:57:17,030 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-24 01:57:17,172 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 01:57:17,175 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 01:57:17,690 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-24 01:57:17,690 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 01:57:18,161 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 01:57:18,161 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-24 01:57:18,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:57:18 BoogieIcfgContainer [2024-11-24 01:57:18,162 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 01:57:18,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 01:57:18,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 01:57:18,172 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 01:57:18,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:57:16" (1/3) ... [2024-11-24 01:57:18,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695f1211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:57:18, skipping insertion in model container [2024-11-24 01:57:18,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:57:16" (2/3) ... [2024-11-24 01:57:18,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695f1211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:57:18, skipping insertion in model container [2024-11-24 01:57:18,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:57:18" (3/3) ... [2024-11-24 01:57:18,175 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult2.wvr.c [2024-11-24 01:57:18,192 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 01:57:18,194 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-mult2.wvr.c that has 5 procedures, 43 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2024-11-24 01:57:18,195 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-24 01:57:18,274 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-24 01:57:18,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 48 transitions, 124 flow [2024-11-24 01:57:18,371 INFO L124 PetriNetUnfolderBase]: 6/44 cut-off events. [2024-11-24 01:57:18,375 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-24 01:57:18,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 44 events. 6/44 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-11-24 01:57:18,380 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 48 transitions, 124 flow [2024-11-24 01:57:18,384 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 43 transitions, 110 flow [2024-11-24 01:57:18,394 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 01:57:18,408 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@61a3947b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 01:57:18,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-24 01:57:18,436 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-24 01:57:18,436 INFO L124 PetriNetUnfolderBase]: 6/42 cut-off events. [2024-11-24 01:57:18,436 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-24 01:57:18,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:57:18,438 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-24 01:57:18,438 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-24 01:57:18,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:57:18,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1111272568, now seen corresponding path program 1 times [2024-11-24 01:57:18,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:57:18,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669682068] [2024-11-24 01:57:18,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:57:18,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:57:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:57:18,913 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-24 01:57:18,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:57:18,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669682068] [2024-11-24 01:57:18,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669682068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:57:18,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:57:18,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:57:18,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177420035] [2024-11-24 01:57:18,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:57:18,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:57:18,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:57:18,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:57:18,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:57:18,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-11-24 01:57:18,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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-24 01:57:18,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:57:18,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-11-24 01:57:18,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:57:19,543 INFO L124 PetriNetUnfolderBase]: 1029/1752 cut-off events. [2024-11-24 01:57:19,545 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2024-11-24 01:57:19,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3307 conditions, 1752 events. 1029/1752 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 10554 event pairs, 252 based on Foata normal form. 1/1642 useless extension candidates. Maximal degree in co-relation 2793. Up to 989 conditions per place. [2024-11-24 01:57:19,577 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 37 selfloop transitions, 3 changer transitions 1/58 dead transitions. [2024-11-24 01:57:19,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 58 transitions, 237 flow [2024-11-24 01:57:19,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:57:19,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 01:57:19,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2024-11-24 01:57:19,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7291666666666666 [2024-11-24 01:57:19,596 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 110 flow. Second operand 3 states and 105 transitions. [2024-11-24 01:57:19,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 58 transitions, 237 flow [2024-11-24 01:57:19,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 211 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-24 01:57:19,615 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 113 flow [2024-11-24 01:57:19,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2024-11-24 01:57:19,622 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2024-11-24 01:57:19,623 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 113 flow [2024-11-24 01:57:19,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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-24 01:57:19,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:57:19,623 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] [2024-11-24 01:57:19,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-24 01:57:19,623 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-24 01:57:19,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:57:19,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1064228257, now seen corresponding path program 1 times [2024-11-24 01:57:19,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:57:19,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208740396] [2024-11-24 01:57:19,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:57:19,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:57:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:57:19,947 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-24 01:57:19,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:57:19,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208740396] [2024-11-24 01:57:19,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208740396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:57:19,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:57:19,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:57:19,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151507640] [2024-11-24 01:57:19,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:57:19,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:57:19,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:57:19,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:57:19,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:57:19,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-11-24 01:57:19,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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-24 01:57:19,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:57:19,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-11-24 01:57:19,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:57:20,499 INFO L124 PetriNetUnfolderBase]: 1203/1954 cut-off events. [2024-11-24 01:57:20,499 INFO L125 PetriNetUnfolderBase]: For 376/376 co-relation queries the response was YES. [2024-11-24 01:57:20,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4084 conditions, 1954 events. 1203/1954 cut-off events. For 376/376 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 11288 event pairs, 362 based on Foata normal form. 58/1909 useless extension candidates. Maximal degree in co-relation 1452. Up to 1131 conditions per place. [2024-11-24 01:57:20,527 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 46 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2024-11-24 01:57:20,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 65 transitions, 263 flow [2024-11-24 01:57:20,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:57:20,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 01:57:20,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-11-24 01:57:20,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7569444444444444 [2024-11-24 01:57:20,530 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 113 flow. Second operand 3 states and 109 transitions. [2024-11-24 01:57:20,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 65 transitions, 263 flow [2024-11-24 01:57:20,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 65 transitions, 259 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-24 01:57:20,552 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 124 flow [2024-11-24 01:57:20,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2024-11-24 01:57:20,553 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2024-11-24 01:57:20,553 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 124 flow [2024-11-24 01:57:20,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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-24 01:57:20,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:57:20,555 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] [2024-11-24 01:57:20,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-24 01:57:20,555 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-24 01:57:20,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:57:20,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1615506339, now seen corresponding path program 1 times [2024-11-24 01:57:20,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:57:20,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032218444] [2024-11-24 01:57:20,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:57:20,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:57:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:57:20,878 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-24 01:57:20,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:57:20,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032218444] [2024-11-24 01:57:20,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032218444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:57:20,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:57:20,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:57:20,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439786197] [2024-11-24 01:57:20,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:57:20,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:57:20,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:57:20,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:57:20,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:57:20,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-11-24 01:57:20,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 46 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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-24 01:57:20,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:57:20,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-11-24 01:57:20,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:57:21,437 INFO L124 PetriNetUnfolderBase]: 1424/2332 cut-off events. [2024-11-24 01:57:21,437 INFO L125 PetriNetUnfolderBase]: For 866/866 co-relation queries the response was YES. [2024-11-24 01:57:21,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5053 conditions, 2332 events. 1424/2332 cut-off events. For 866/866 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 13417 event pairs, 399 based on Foata normal form. 27/2248 useless extension candidates. Maximal degree in co-relation 3352. Up to 1290 conditions per place. [2024-11-24 01:57:21,456 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 46 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2024-11-24 01:57:21,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 65 transitions, 279 flow [2024-11-24 01:57:21,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:57:21,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 01:57:21,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-11-24 01:57:21,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7430555555555556 [2024-11-24 01:57:21,459 INFO L175 Difference]: Start difference. First operand has 47 places, 46 transitions, 124 flow. Second operand 3 states and 107 transitions. [2024-11-24 01:57:21,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 65 transitions, 279 flow [2024-11-24 01:57:21,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 65 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-24 01:57:21,464 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 136 flow [2024-11-24 01:57:21,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=49, PETRI_TRANSITIONS=47} [2024-11-24 01:57:21,465 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2024-11-24 01:57:21,465 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 136 flow [2024-11-24 01:57:21,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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-24 01:57:21,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:57:21,467 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] [2024-11-24 01:57:21,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-24 01:57:21,467 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-24 01:57:21,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:57:21,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1703526958, now seen corresponding path program 1 times [2024-11-24 01:57:21,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:57:21,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916653360] [2024-11-24 01:57:21,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:57:21,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:57:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:57:21,824 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-24 01:57:21,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:57:21,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916653360] [2024-11-24 01:57:21,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916653360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:57:21,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:57:21,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:57:21,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643252481] [2024-11-24 01:57:21,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:57:21,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:57:21,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:57:21,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:57:21,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:57:21,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-11-24 01:57:21,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 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-24 01:57:21,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:57:21,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-11-24 01:57:21,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:57:22,423 INFO L124 PetriNetUnfolderBase]: 1779/2854 cut-off events. [2024-11-24 01:57:22,423 INFO L125 PetriNetUnfolderBase]: For 1450/1450 co-relation queries the response was YES. [2024-11-24 01:57:22,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6679 conditions, 2854 events. 1779/2854 cut-off events. For 1450/1450 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 17707 event pairs, 1276 based on Foata normal form. 71/2633 useless extension candidates. Maximal degree in co-relation 3426. Up to 1895 conditions per place. [2024-11-24 01:57:22,447 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 52 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2024-11-24 01:57:22,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 72 transitions, 319 flow [2024-11-24 01:57:22,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:57:22,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-24 01:57:22,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2024-11-24 01:57:22,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6979166666666666 [2024-11-24 01:57:22,450 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 136 flow. Second operand 4 states and 134 transitions. [2024-11-24 01:57:22,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 72 transitions, 319 flow [2024-11-24 01:57:22,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 72 transitions, 316 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-24 01:57:22,456 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 154 flow [2024-11-24 01:57:22,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2024-11-24 01:57:22,457 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2024-11-24 01:57:22,457 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 154 flow [2024-11-24 01:57:22,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 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-24 01:57:22,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:57:22,459 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] [2024-11-24 01:57:22,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-24 01:57:22,459 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-24 01:57:22,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:57:22,460 INFO L85 PathProgramCache]: Analyzing trace with hash -2049540902, now seen corresponding path program 1 times [2024-11-24 01:57:22,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:57:22,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58197435] [2024-11-24 01:57:22,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:57:22,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:57:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:57:22,709 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-24 01:57:22,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:57:22,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58197435] [2024-11-24 01:57:22,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58197435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:57:22,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:57:22,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:57:22,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933917030] [2024-11-24 01:57:22,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:57:22,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:57:22,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:57:22,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:57:22,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:57:22,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-11-24 01:57:22,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 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-24 01:57:22,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:57:22,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-11-24 01:57:22,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:57:23,454 INFO L124 PetriNetUnfolderBase]: 2311/3846 cut-off events. [2024-11-24 01:57:23,454 INFO L125 PetriNetUnfolderBase]: For 1970/1970 co-relation queries the response was YES. [2024-11-24 01:57:23,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8742 conditions, 3846 events. 2311/3846 cut-off events. For 1970/1970 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 26196 event pairs, 1724 based on Foata normal form. 112/3572 useless extension candidates. Maximal degree in co-relation 6824. Up to 2485 conditions per place. [2024-11-24 01:57:23,495 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 51 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2024-11-24 01:57:23,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 72 transitions, 334 flow [2024-11-24 01:57:23,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:57:23,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-24 01:57:23,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2024-11-24 01:57:23,497 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2024-11-24 01:57:23,497 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 154 flow. Second operand 4 states and 132 transitions. [2024-11-24 01:57:23,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 72 transitions, 334 flow [2024-11-24 01:57:23,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 330 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-24 01:57:23,505 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 173 flow [2024-11-24 01:57:23,506 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2024-11-24 01:57:23,506 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2024-11-24 01:57:23,508 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 173 flow [2024-11-24 01:57:23,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 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-24 01:57:23,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:57:23,509 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] [2024-11-24 01:57:23,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-24 01:57:23,512 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-24 01:57:23,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:57:23,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1689535602, now seen corresponding path program 1 times [2024-11-24 01:57:23,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:57:23,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658353607] [2024-11-24 01:57:23,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:57:23,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:57:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:57:24,269 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-24 01:57:24,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:57:24,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658353607] [2024-11-24 01:57:24,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658353607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:57:24,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:57:24,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:57:24,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043711483] [2024-11-24 01:57:24,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:57:24,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:57:24,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:57:24,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:57:24,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:57:24,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-11-24 01:57:24,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 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-24 01:57:24,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:57:24,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-11-24 01:57:24,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:57:26,143 INFO L124 PetriNetUnfolderBase]: 6939/10810 cut-off events. [2024-11-24 01:57:26,143 INFO L125 PetriNetUnfolderBase]: For 4437/4553 co-relation queries the response was YES. [2024-11-24 01:57:26,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24442 conditions, 10810 events. 6939/10810 cut-off events. For 4437/4553 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 74044 event pairs, 1253 based on Foata normal form. 12/9981 useless extension candidates. Maximal degree in co-relation 18868. Up to 7201 conditions per place. [2024-11-24 01:57:26,231 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 70 selfloop transitions, 7 changer transitions 20/109 dead transitions. [2024-11-24 01:57:26,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 109 transitions, 518 flow [2024-11-24 01:57:26,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:57:26,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 01:57:26,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2024-11-24 01:57:26,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2024-11-24 01:57:26,234 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 173 flow. Second operand 6 states and 186 transitions. [2024-11-24 01:57:26,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 109 transitions, 518 flow [2024-11-24 01:57:26,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 109 transitions, 513 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-24 01:57:26,240 INFO L231 Difference]: Finished difference. Result has 65 places, 57 transitions, 231 flow [2024-11-24 01:57:26,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=65, PETRI_TRANSITIONS=57} [2024-11-24 01:57:26,242 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 15 predicate places. [2024-11-24 01:57:26,244 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 231 flow [2024-11-24 01:57:26,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 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-24 01:57:26,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:57:26,244 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] [2024-11-24 01:57:26,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-24 01:57:26,245 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-24 01:57:26,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:57:26,245 INFO L85 PathProgramCache]: Analyzing trace with hash 458883420, now seen corresponding path program 1 times [2024-11-24 01:57:26,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:57:26,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582561900] [2024-11-24 01:57:26,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:57:26,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:57:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:57:26,937 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-24 01:57:26,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:57:26,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582561900] [2024-11-24 01:57:26,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582561900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:57:26,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:57:26,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 01:57:26,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732935299] [2024-11-24 01:57:26,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:57:26,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 01:57:26,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:57:26,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 01:57:26,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:57:27,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-11-24 01:57:27,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 231 flow. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 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-24 01:57:27,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:57:27,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-11-24 01:57:27,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:57:28,711 INFO L124 PetriNetUnfolderBase]: 6691/10548 cut-off events. [2024-11-24 01:57:28,711 INFO L125 PetriNetUnfolderBase]: For 7136/7240 co-relation queries the response was YES. [2024-11-24 01:57:28,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26391 conditions, 10548 events. 6691/10548 cut-off events. For 7136/7240 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 72032 event pairs, 1515 based on Foata normal form. 62/10426 useless extension candidates. Maximal degree in co-relation 20060. Up to 7041 conditions per place. [2024-11-24 01:57:28,778 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 67 selfloop transitions, 9 changer transitions 21/109 dead transitions. [2024-11-24 01:57:28,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 109 transitions, 584 flow [2024-11-24 01:57:28,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:57:28,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 01:57:28,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions. [2024-11-24 01:57:28,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-11-24 01:57:28,779 INFO L175 Difference]: Start difference. First operand has 65 places, 57 transitions, 231 flow. Second operand 6 states and 184 transitions. [2024-11-24 01:57:28,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 109 transitions, 584 flow [2024-11-24 01:57:28,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 109 transitions, 582 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-24 01:57:28,802 INFO L231 Difference]: Finished difference. Result has 72 places, 61 transitions, 290 flow [2024-11-24 01:57:28,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=290, PETRI_PLACES=72, PETRI_TRANSITIONS=61} [2024-11-24 01:57:28,804 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 22 predicate places. [2024-11-24 01:57:28,804 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 61 transitions, 290 flow [2024-11-24 01:57:28,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 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-24 01:57:28,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:57:28,805 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] [2024-11-24 01:57:28,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-24 01:57:28,805 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-24 01:57:28,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:57:28,807 INFO L85 PathProgramCache]: Analyzing trace with hash -509152326, now seen corresponding path program 2 times [2024-11-24 01:57:28,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:57:28,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943122168] [2024-11-24 01:57:28,807 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 01:57:28,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:57:28,853 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-24 01:57:28,854 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 01:57:29,308 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-24 01:57:29,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:57:29,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943122168] [2024-11-24 01:57:29,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943122168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:57:29,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:57:29,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 01:57:29,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181876085] [2024-11-24 01:57:29,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:57:29,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 01:57:29,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:57:29,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 01:57:29,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:57:29,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-11-24 01:57:29,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 290 flow. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 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-24 01:57:29,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:57:29,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-11-24 01:57:29,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:57:31,265 INFO L124 PetriNetUnfolderBase]: 7733/11972 cut-off events. [2024-11-24 01:57:31,265 INFO L125 PetriNetUnfolderBase]: For 12055/12123 co-relation queries the response was YES. [2024-11-24 01:57:31,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32990 conditions, 11972 events. 7733/11972 cut-off events. For 12055/12123 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 82374 event pairs, 1323 based on Foata normal form. 292/12107 useless extension candidates. Maximal degree in co-relation 26063. Up to 7233 conditions per place. [2024-11-24 01:57:31,382 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 109 selfloop transitions, 15 changer transitions 4/140 dead transitions. [2024-11-24 01:57:31,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 140 transitions, 825 flow [2024-11-24 01:57:31,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 01:57:31,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-24 01:57:31,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 243 transitions. [2024-11-24 01:57:31,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6328125 [2024-11-24 01:57:31,385 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 290 flow. Second operand 8 states and 243 transitions. [2024-11-24 01:57:31,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 140 transitions, 825 flow [2024-11-24 01:57:31,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 140 transitions, 807 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-11-24 01:57:31,426 INFO L231 Difference]: Finished difference. Result has 81 places, 68 transitions, 394 flow [2024-11-24 01:57:31,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=394, PETRI_PLACES=81, PETRI_TRANSITIONS=68} [2024-11-24 01:57:31,428 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 31 predicate places. [2024-11-24 01:57:31,430 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 68 transitions, 394 flow [2024-11-24 01:57:31,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 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-24 01:57:31,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:57:31,431 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] [2024-11-24 01:57:31,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-24 01:57:31,431 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-24 01:57:31,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:57:31,432 INFO L85 PathProgramCache]: Analyzing trace with hash -631275424, now seen corresponding path program 3 times [2024-11-24 01:57:31,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:57:31,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344038464] [2024-11-24 01:57:31,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-24 01:57:31,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:57:31,517 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-24 01:57:31,521 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 01:57:32,129 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-24 01:57:32,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:57:32,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344038464] [2024-11-24 01:57:32,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344038464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:57:32,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:57:32,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:57:32,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080019046] [2024-11-24 01:57:32,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:57:32,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:57:32,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:57:32,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:57:32,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:57:32,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-11-24 01:57:32,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 68 transitions, 394 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 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-24 01:57:32,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:57:32,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-11-24 01:57:32,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:57:34,131 INFO L124 PetriNetUnfolderBase]: 9180/14640 cut-off events. [2024-11-24 01:57:34,132 INFO L125 PetriNetUnfolderBase]: For 23443/24013 co-relation queries the response was YES. [2024-11-24 01:57:34,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41803 conditions, 14640 events. 9180/14640 cut-off events. For 23443/24013 co-relation queries the response was YES. Maximal size of possible extension queue 935. Compared 109466 event pairs, 2100 based on Foata normal form. 374/14507 useless extension candidates. Maximal degree in co-relation 32229. Up to 9324 conditions per place. [2024-11-24 01:57:34,376 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 79 selfloop transitions, 32 changer transitions 37/163 dead transitions. [2024-11-24 01:57:34,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 163 transitions, 1254 flow [2024-11-24 01:57:34,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-24 01:57:34,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-24 01:57:34,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 263 transitions. [2024-11-24 01:57:34,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6087962962962963 [2024-11-24 01:57:34,378 INFO L175 Difference]: Start difference. First operand has 81 places, 68 transitions, 394 flow. Second operand 9 states and 263 transitions. [2024-11-24 01:57:34,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 163 transitions, 1254 flow [2024-11-24 01:57:34,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 163 transitions, 1218 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-24 01:57:34,429 INFO L231 Difference]: Finished difference. Result has 93 places, 90 transitions, 728 flow [2024-11-24 01:57:34,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=728, PETRI_PLACES=93, PETRI_TRANSITIONS=90} [2024-11-24 01:57:34,432 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 43 predicate places. [2024-11-24 01:57:34,432 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 90 transitions, 728 flow [2024-11-24 01:57:34,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 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-24 01:57:34,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:57:34,433 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] [2024-11-24 01:57:34,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-24 01:57:34,433 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-24 01:57:34,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:57:34,434 INFO L85 PathProgramCache]: Analyzing trace with hash 99880160, now seen corresponding path program 4 times [2024-11-24 01:57:34,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:57:34,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642188329] [2024-11-24 01:57:34,436 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-24 01:57:34,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:57:34,473 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-24 01:57:34,476 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 01:57:34,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-24 01:57:34,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:57:34,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642188329] [2024-11-24 01:57:34,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642188329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:57:34,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:57:34,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:57:34,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065633458] [2024-11-24 01:57:34,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:57:34,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:57:34,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:57:34,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:57:34,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:57:34,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-11-24 01:57:34,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 90 transitions, 728 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 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-24 01:57:34,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:57:34,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-11-24 01:57:34,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:57:37,279 INFO L124 PetriNetUnfolderBase]: 10431/16178 cut-off events. [2024-11-24 01:57:37,279 INFO L125 PetriNetUnfolderBase]: For 28355/28595 co-relation queries the response was YES. [2024-11-24 01:57:37,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50674 conditions, 16178 events. 10431/16178 cut-off events. For 28355/28595 co-relation queries the response was YES. Maximal size of possible extension queue 1071. Compared 118893 event pairs, 878 based on Foata normal form. 686/16532 useless extension candidates. Maximal degree in co-relation 48746. Up to 6145 conditions per place. [2024-11-24 01:57:37,439 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 121 selfloop transitions, 49 changer transitions 12/197 dead transitions. [2024-11-24 01:57:37,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 197 transitions, 1611 flow [2024-11-24 01:57:37,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-24 01:57:37,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-24 01:57:37,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 273 transitions. [2024-11-24 01:57:37,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6319444444444444 [2024-11-24 01:57:37,445 INFO L175 Difference]: Start difference. First operand has 93 places, 90 transitions, 728 flow. Second operand 9 states and 273 transitions. [2024-11-24 01:57:37,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 197 transitions, 1611 flow [2024-11-24 01:57:37,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 197 transitions, 1601 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-11-24 01:57:37,866 INFO L231 Difference]: Finished difference. Result has 102 places, 109 transitions, 1074 flow [2024-11-24 01:57:37,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1074, PETRI_PLACES=102, PETRI_TRANSITIONS=109} [2024-11-24 01:57:37,868 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 52 predicate places. [2024-11-24 01:57:37,869 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 109 transitions, 1074 flow [2024-11-24 01:57:37,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 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-24 01:57:37,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:57:37,869 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] [2024-11-24 01:57:37,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-24 01:57:37,869 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-24 01:57:37,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:57:37,872 INFO L85 PathProgramCache]: Analyzing trace with hash 131299188, now seen corresponding path program 5 times [2024-11-24 01:57:37,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:57:37,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034937930] [2024-11-24 01:57:37,873 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-24 01:57:37,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:57:37,920 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-24 01:57:37,924 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 01:57:38,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-24 01:57:38,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:57:38,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034937930] [2024-11-24 01:57:38,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034937930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:57:38,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:57:38,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 01:57:38,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309406352] [2024-11-24 01:57:38,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:57:38,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 01:57:38,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:57:38,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 01:57:38,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:57:38,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-11-24 01:57:38,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 109 transitions, 1074 flow. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 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-24 01:57:38,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:57:38,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-11-24 01:57:38,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:57:42,611 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([836] L107-->L112: Formula: (let ((.cse0 (<= 0 (+ |v_thread4Thread1of1ForFork2_plus_#res#1_1| 2147483648))) (.cse1 (<= |v_thread4Thread1of1ForFork2_plus_#res#1_1| 2147483647))) (and (not (= (ite (and (< v_~q2_front~0_95 v_~n2~0_78) (< v_~q2_front~0_95 v_~q2_back~0_86) (<= 0 v_~q2_front~0_95)) 1 0) 0)) .cse0 (= |v_thread4Thread1of1ForFork2_plus_#res#1_1| v_~total~0_91) .cse1 (= (+ v_~q2_front~0_95 1) v_~q2_front~0_94) (not (= (ite (or .cse0 (<= v_~total~0_92 |v_thread4Thread1of1ForFork2_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or .cse1 (<= |v_thread4Thread1of1ForFork2_plus_#res#1_1| v_~total~0_92)) 1 0) 0)) (= |v_thread4Thread1of1ForFork2_plus_#res#1_1| (+ v_~total~0_92 (select (select |v_#memory_int#1_95| v_~q2~0.base_91) (+ v_~q2~0.offset_91 (* 4 v_~q2_front~0_95))))))) InVars {~n2~0=v_~n2~0_78, ~q2~0.offset=v_~q2~0.offset_91, ~q2_front~0=v_~q2_front~0_95, ~q2~0.base=v_~q2~0.base_91, #memory_int#1=|v_#memory_int#1_95|, ~q2_back~0=v_~q2_back~0_86, ~total~0=v_~total~0_92} 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_1|, ~n2~0=v_~n2~0_78, ~q2~0.offset=v_~q2~0.offset_91, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_94, 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_95|, thread4Thread1of1ForFork2_#t~mem10#1=|v_thread4Thread1of1ForFork2_#t~mem10#1_1|, ~total~0=v_~total~0_91, thread4Thread1of1ForFork2_#t~post12#1=|v_thread4Thread1of1ForFork2_#t~post12#1_1|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_1|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_1|, ~q2~0.base=v_~q2~0.base_91, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_1|, ~q2_back~0=v_~q2_back~0_86} 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][214], [Black: 121#(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: 64#(<= ~q1_back~0 ~q1_front~0), Black: 125#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 119#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 18#thread3EXITtrue, Black: 68#(<= ~q2_back~0 ~q2_front~0), 44#L143true, 131#true, Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 73#(<= ~n1~0 0), Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 140#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 79#(<= ~n2~0 0), Black: 135#(and (= ~i~0 0) (<= ~N~0 0)), Black: 133#(and (= ~j~0 0) (= ~i~0 0)), Black: 134#(or (and (= ~i~0 0) (<= ~N~0 0)) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))), 45#L112true, 82#true, Black: 84#(and (= ~j~0 0) (= ~i~0 0)), Black: 91#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 89#(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)), 172#true, Black: 156#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 162#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 164#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 160#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 166#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 151#true, Black: 106#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 101#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)))), Black: 100#(and (= ~j~0 0) (= ~i~0 0)), Black: 60#(= ~total~0 0), Black: 123#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 118#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))]) [2024-11-24 01:57:42,612 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-24 01:57:42,612 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-24 01:57:42,612 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-24 01:57:42,612 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-24 01:57:42,613 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([835] L115-->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][148], [Black: 121#(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: 64#(<= ~q1_back~0 ~q1_front~0), Black: 125#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 119#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 18#thread3EXITtrue, Black: 68#(<= ~q2_back~0 ~q2_front~0), 44#L143true, 131#true, Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 73#(<= ~n1~0 0), Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 140#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 79#(<= ~n2~0 0), Black: 135#(and (= ~i~0 0) (<= ~N~0 0)), Black: 133#(and (= ~j~0 0) (= ~i~0 0)), 15#thread4EXITtrue, Black: 134#(or (and (= ~i~0 0) (<= ~N~0 0)) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))), 82#true, Black: 84#(and (= ~j~0 0) (= ~i~0 0)), Black: 91#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 89#(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)), 172#true, Black: 156#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 162#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 164#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 160#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 166#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 151#true, Black: 106#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 101#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)))), Black: 100#(and (= ~j~0 0) (= ~i~0 0)), Black: 60#(= ~total~0 0), Black: 123#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 118#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))]) [2024-11-24 01:57:42,613 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-24 01:57:42,613 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-24 01:57:42,613 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-24 01:57:42,613 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-24 01:57:42,616 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([836] L107-->L112: Formula: (let ((.cse0 (<= 0 (+ |v_thread4Thread1of1ForFork2_plus_#res#1_1| 2147483648))) (.cse1 (<= |v_thread4Thread1of1ForFork2_plus_#res#1_1| 2147483647))) (and (not (= (ite (and (< v_~q2_front~0_95 v_~n2~0_78) (< v_~q2_front~0_95 v_~q2_back~0_86) (<= 0 v_~q2_front~0_95)) 1 0) 0)) .cse0 (= |v_thread4Thread1of1ForFork2_plus_#res#1_1| v_~total~0_91) .cse1 (= (+ v_~q2_front~0_95 1) v_~q2_front~0_94) (not (= (ite (or .cse0 (<= v_~total~0_92 |v_thread4Thread1of1ForFork2_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or .cse1 (<= |v_thread4Thread1of1ForFork2_plus_#res#1_1| v_~total~0_92)) 1 0) 0)) (= |v_thread4Thread1of1ForFork2_plus_#res#1_1| (+ v_~total~0_92 (select (select |v_#memory_int#1_95| v_~q2~0.base_91) (+ v_~q2~0.offset_91 (* 4 v_~q2_front~0_95))))))) InVars {~n2~0=v_~n2~0_78, ~q2~0.offset=v_~q2~0.offset_91, ~q2_front~0=v_~q2_front~0_95, ~q2~0.base=v_~q2~0.base_91, #memory_int#1=|v_#memory_int#1_95|, ~q2_back~0=v_~q2_back~0_86, ~total~0=v_~total~0_92} 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_1|, ~n2~0=v_~n2~0_78, ~q2~0.offset=v_~q2~0.offset_91, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_94, 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_95|, thread4Thread1of1ForFork2_#t~mem10#1=|v_thread4Thread1of1ForFork2_#t~mem10#1_1|, ~total~0=v_~total~0_91, thread4Thread1of1ForFork2_#t~post12#1=|v_thread4Thread1of1ForFork2_#t~post12#1_1|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_1|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_1|, ~q2~0.base=v_~q2~0.base_91, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_1|, ~q2_back~0=v_~q2_back~0_86} 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][214], [Black: 121#(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: 64#(<= ~q1_back~0 ~q1_front~0), Black: 125#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 119#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 68#(<= ~q2_back~0 ~q2_front~0), 131#true, Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 73#(<= ~n1~0 0), Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 140#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 79#(<= ~n2~0 0), Black: 135#(and (= ~i~0 0) (<= ~N~0 0)), Black: 133#(and (= ~j~0 0) (= ~i~0 0)), Black: 134#(or (and (= ~i~0 0) (<= ~N~0 0)) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))), 45#L112true, 82#true, Black: 84#(and (= ~j~0 0) (= ~i~0 0)), Black: 91#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 89#(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)), 172#true, Black: 156#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 162#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 164#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 160#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 166#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 151#true, Black: 106#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 101#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)))), Black: 100#(and (= ~j~0 0) (= ~i~0 0)), 12#L144true, Black: 60#(= ~total~0 0), Black: 123#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 118#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))]) [2024-11-24 01:57:42,616 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-24 01:57:42,616 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-24 01:57:42,616 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-24 01:57:42,616 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-24 01:57:42,617 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([835] L115-->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][148], [Black: 121#(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: 64#(<= ~q1_back~0 ~q1_front~0), Black: 125#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 119#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 68#(<= ~q2_back~0 ~q2_front~0), 131#true, Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 73#(<= ~n1~0 0), Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 140#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 79#(<= ~n2~0 0), Black: 135#(and (= ~i~0 0) (<= ~N~0 0)), Black: 133#(and (= ~j~0 0) (= ~i~0 0)), Black: 134#(or (and (= ~i~0 0) (<= ~N~0 0)) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))), 15#thread4EXITtrue, 82#true, Black: 84#(and (= ~j~0 0) (= ~i~0 0)), Black: 91#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 89#(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)), 172#true, Black: 156#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 162#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 164#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 160#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 166#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 151#true, Black: 106#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 101#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)))), Black: 100#(and (= ~j~0 0) (= ~i~0 0)), 12#L144true, Black: 60#(= ~total~0 0), Black: 123#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 118#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))]) [2024-11-24 01:57:42,617 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-24 01:57:42,617 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-24 01:57:42,617 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-24 01:57:42,617 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-24 01:57:42,622 INFO L124 PetriNetUnfolderBase]: 14641/22591 cut-off events. [2024-11-24 01:57:42,622 INFO L125 PetriNetUnfolderBase]: For 65134/66097 co-relation queries the response was YES. [2024-11-24 01:57:42,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79035 conditions, 22591 events. 14641/22591 cut-off events. For 65134/66097 co-relation queries the response was YES. Maximal size of possible extension queue 1490. Compared 170336 event pairs, 3509 based on Foata normal form. 582/22669 useless extension candidates. Maximal degree in co-relation 74787. Up to 13886 conditions per place. [2024-11-24 01:57:42,782 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 146 selfloop transitions, 62 changer transitions 12/239 dead transitions. [2024-11-24 01:57:42,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 239 transitions, 2311 flow [2024-11-24 01:57:42,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 01:57:42,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-24 01:57:42,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 307 transitions. [2024-11-24 01:57:42,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6395833333333333 [2024-11-24 01:57:42,785 INFO L175 Difference]: Start difference. First operand has 102 places, 109 transitions, 1074 flow. Second operand 10 states and 307 transitions. [2024-11-24 01:57:42,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 239 transitions, 2311 flow [2024-11-24 01:57:43,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 239 transitions, 2250 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-11-24 01:57:43,419 INFO L231 Difference]: Finished difference. Result has 114 places, 140 transitions, 1658 flow [2024-11-24 01:57:43,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1658, PETRI_PLACES=114, PETRI_TRANSITIONS=140} [2024-11-24 01:57:43,420 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 64 predicate places. [2024-11-24 01:57:43,420 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 140 transitions, 1658 flow [2024-11-24 01:57:43,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 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-24 01:57:43,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:57:43,421 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] [2024-11-24 01:57:43,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-24 01:57:43,421 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-24 01:57:43,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:57:43,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1830541392, now seen corresponding path program 6 times [2024-11-24 01:57:43,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:57:43,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132407700] [2024-11-24 01:57:43,422 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-24 01:57:43,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:57:43,447 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-24 01:57:43,448 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 01:57:43,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-24 01:57:43,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:57:43,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132407700] [2024-11-24 01:57:43,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132407700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:57:43,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:57:43,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 01:57:43,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366029253] [2024-11-24 01:57:43,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:57:43,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 01:57:43,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:57:43,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 01:57:43,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:57:43,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-11-24 01:57:43,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 140 transitions, 1658 flow. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 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-24 01:57:43,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:57:43,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-11-24 01:57:43,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:57:48,604 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([836] L107-->L112: Formula: (let ((.cse0 (<= 0 (+ |v_thread4Thread1of1ForFork2_plus_#res#1_1| 2147483648))) (.cse1 (<= |v_thread4Thread1of1ForFork2_plus_#res#1_1| 2147483647))) (and (not (= (ite (and (< v_~q2_front~0_95 v_~n2~0_78) (< v_~q2_front~0_95 v_~q2_back~0_86) (<= 0 v_~q2_front~0_95)) 1 0) 0)) .cse0 (= |v_thread4Thread1of1ForFork2_plus_#res#1_1| v_~total~0_91) .cse1 (= (+ v_~q2_front~0_95 1) v_~q2_front~0_94) (not (= (ite (or .cse0 (<= v_~total~0_92 |v_thread4Thread1of1ForFork2_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or .cse1 (<= |v_thread4Thread1of1ForFork2_plus_#res#1_1| v_~total~0_92)) 1 0) 0)) (= |v_thread4Thread1of1ForFork2_plus_#res#1_1| (+ v_~total~0_92 (select (select |v_#memory_int#1_95| v_~q2~0.base_91) (+ v_~q2~0.offset_91 (* 4 v_~q2_front~0_95))))))) InVars {~n2~0=v_~n2~0_78, ~q2~0.offset=v_~q2~0.offset_91, ~q2_front~0=v_~q2_front~0_95, ~q2~0.base=v_~q2~0.base_91, #memory_int#1=|v_#memory_int#1_95|, ~q2_back~0=v_~q2_back~0_86, ~total~0=v_~total~0_92} 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_1|, ~n2~0=v_~n2~0_78, ~q2~0.offset=v_~q2~0.offset_91, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_94, 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_95|, thread4Thread1of1ForFork2_#t~mem10#1=|v_thread4Thread1of1ForFork2_#t~mem10#1_1|, ~total~0=v_~total~0_91, thread4Thread1of1ForFork2_#t~post12#1=|v_thread4Thread1of1ForFork2_#t~post12#1_1|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_1|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_1|, ~q2~0.base=v_~q2~0.base_91, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_1|, ~q2_back~0=v_~q2_back~0_86} 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][216], [Black: 121#(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: 184#(and (or (= ~i~0 0) (< 0 |thread2Thread1of1ForFork3_~cond~1#1|)) (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (< |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 125#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 176#(and (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (and (= ~i~0 0) (<= ~N~0 0))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 188#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 119#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 18#thread3EXITtrue, 44#L143true, Black: 68#(<= ~q2_back~0 ~q2_front~0), 131#true, Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 73#(<= ~n1~0 0), Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 140#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 79#(<= ~n2~0 0), Black: 135#(and (= ~i~0 0) (<= ~N~0 0)), Black: 133#(and (= ~j~0 0) (= ~i~0 0)), Black: 134#(or (and (= ~i~0 0) (<= ~N~0 0)) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))), 45#L112true, 82#true, Black: 84#(and (= ~j~0 0) (= ~i~0 0)), Black: 91#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 89#(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)), 172#true, Black: 156#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 162#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 164#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 160#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 166#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 151#true, Black: 106#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 101#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)))), Black: 100#(and (= ~j~0 0) (= ~i~0 0)), 195#true, Black: 60#(= ~total~0 0), Black: 182#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 175#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 123#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 180#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (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: 118#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))]) [2024-11-24 01:57:48,604 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-24 01:57:48,605 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-24 01:57:48,605 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-24 01:57:48,605 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-24 01:57:48,605 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([835] L115-->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][162], [Black: 121#(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: 184#(and (or (= ~i~0 0) (< 0 |thread2Thread1of1ForFork3_~cond~1#1|)) (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (< |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 125#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 176#(and (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (and (= ~i~0 0) (<= ~N~0 0))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 188#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 119#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 18#thread3EXITtrue, 44#L143true, Black: 68#(<= ~q2_back~0 ~q2_front~0), 131#true, Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 73#(<= ~n1~0 0), Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 140#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 79#(<= ~n2~0 0), Black: 135#(and (= ~i~0 0) (<= ~N~0 0)), Black: 133#(and (= ~j~0 0) (= ~i~0 0)), Black: 134#(or (and (= ~i~0 0) (<= ~N~0 0)) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))), 15#thread4EXITtrue, 82#true, Black: 84#(and (= ~j~0 0) (= ~i~0 0)), Black: 91#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 89#(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)), 172#true, Black: 156#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 162#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 164#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 160#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 166#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 151#true, Black: 106#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 101#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)))), Black: 100#(and (= ~j~0 0) (= ~i~0 0)), 195#true, Black: 60#(= ~total~0 0), Black: 182#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 175#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 123#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 180#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (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: 118#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))]) [2024-11-24 01:57:48,605 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-24 01:57:48,605 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-24 01:57:48,605 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-24 01:57:48,605 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-24 01:57:48,607 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([836] L107-->L112: Formula: (let ((.cse0 (<= 0 (+ |v_thread4Thread1of1ForFork2_plus_#res#1_1| 2147483648))) (.cse1 (<= |v_thread4Thread1of1ForFork2_plus_#res#1_1| 2147483647))) (and (not (= (ite (and (< v_~q2_front~0_95 v_~n2~0_78) (< v_~q2_front~0_95 v_~q2_back~0_86) (<= 0 v_~q2_front~0_95)) 1 0) 0)) .cse0 (= |v_thread4Thread1of1ForFork2_plus_#res#1_1| v_~total~0_91) .cse1 (= (+ v_~q2_front~0_95 1) v_~q2_front~0_94) (not (= (ite (or .cse0 (<= v_~total~0_92 |v_thread4Thread1of1ForFork2_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or .cse1 (<= |v_thread4Thread1of1ForFork2_plus_#res#1_1| v_~total~0_92)) 1 0) 0)) (= |v_thread4Thread1of1ForFork2_plus_#res#1_1| (+ v_~total~0_92 (select (select |v_#memory_int#1_95| v_~q2~0.base_91) (+ v_~q2~0.offset_91 (* 4 v_~q2_front~0_95))))))) InVars {~n2~0=v_~n2~0_78, ~q2~0.offset=v_~q2~0.offset_91, ~q2_front~0=v_~q2_front~0_95, ~q2~0.base=v_~q2~0.base_91, #memory_int#1=|v_#memory_int#1_95|, ~q2_back~0=v_~q2_back~0_86, ~total~0=v_~total~0_92} 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_1|, ~n2~0=v_~n2~0_78, ~q2~0.offset=v_~q2~0.offset_91, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_94, 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_95|, thread4Thread1of1ForFork2_#t~mem10#1=|v_thread4Thread1of1ForFork2_#t~mem10#1_1|, ~total~0=v_~total~0_91, thread4Thread1of1ForFork2_#t~post12#1=|v_thread4Thread1of1ForFork2_#t~post12#1_1|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_1|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_1|, ~q2~0.base=v_~q2~0.base_91, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_1|, ~q2_back~0=v_~q2_back~0_86} 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][216], [Black: 121#(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: 184#(and (or (= ~i~0 0) (< 0 |thread2Thread1of1ForFork3_~cond~1#1|)) (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (< |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 125#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 176#(and (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (and (= ~i~0 0) (<= ~N~0 0))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 188#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 119#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 68#(<= ~q2_back~0 ~q2_front~0), 131#true, Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 73#(<= ~n1~0 0), Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 140#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 79#(<= ~n2~0 0), Black: 135#(and (= ~i~0 0) (<= ~N~0 0)), Black: 133#(and (= ~j~0 0) (= ~i~0 0)), Black: 134#(or (and (= ~i~0 0) (<= ~N~0 0)) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))), 45#L112true, 82#true, Black: 84#(and (= ~j~0 0) (= ~i~0 0)), Black: 91#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 89#(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)), 172#true, Black: 156#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 162#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 164#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 160#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 166#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 151#true, Black: 106#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 101#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)))), Black: 100#(and (= ~j~0 0) (= ~i~0 0)), 195#true, 12#L144true, Black: 182#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 60#(= ~total~0 0), Black: 175#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 123#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 180#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (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: 118#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))]) [2024-11-24 01:57:48,607 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-24 01:57:48,607 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-24 01:57:48,607 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-24 01:57:48,607 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-24 01:57:48,607 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([835] L115-->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][162], [Black: 121#(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: 184#(and (or (= ~i~0 0) (< 0 |thread2Thread1of1ForFork3_~cond~1#1|)) (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (< |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 125#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 176#(and (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (and (= ~i~0 0) (<= ~N~0 0))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 188#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 119#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 68#(<= ~q2_back~0 ~q2_front~0), 131#true, Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 73#(<= ~n1~0 0), Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 140#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 79#(<= ~n2~0 0), Black: 135#(and (= ~i~0 0) (<= ~N~0 0)), Black: 133#(and (= ~j~0 0) (= ~i~0 0)), Black: 134#(or (and (= ~i~0 0) (<= ~N~0 0)) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))), 15#thread4EXITtrue, 82#true, Black: 84#(and (= ~j~0 0) (= ~i~0 0)), Black: 91#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 89#(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)), 172#true, Black: 156#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 162#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 164#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 160#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 151#true, Black: 166#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 106#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 101#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)))), Black: 100#(and (= ~j~0 0) (= ~i~0 0)), 195#true, 12#L144true, Black: 60#(= ~total~0 0), Black: 182#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 175#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 123#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 180#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (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: 118#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))]) [2024-11-24 01:57:48,607 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-24 01:57:48,607 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-24 01:57:48,607 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-24 01:57:48,607 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-24 01:57:48,612 INFO L124 PetriNetUnfolderBase]: 16271/25306 cut-off events. [2024-11-24 01:57:48,612 INFO L125 PetriNetUnfolderBase]: For 77368/78445 co-relation queries the response was YES. [2024-11-24 01:57:48,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95592 conditions, 25306 events. 16271/25306 cut-off events. For 77368/78445 co-relation queries the response was YES. Maximal size of possible extension queue 1701. Compared 196880 event pairs, 2082 based on Foata normal form. 868/25702 useless extension candidates. Maximal degree in co-relation 90673. Up to 10784 conditions per place. [2024-11-24 01:57:48,806 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 149 selfloop transitions, 65 changer transitions 6/239 dead transitions. [2024-11-24 01:57:48,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 239 transitions, 2574 flow [2024-11-24 01:57:48,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-24 01:57:48,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-24 01:57:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 277 transitions. [2024-11-24 01:57:48,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6412037037037037 [2024-11-24 01:57:48,808 INFO L175 Difference]: Start difference. First operand has 114 places, 140 transitions, 1658 flow. Second operand 9 states and 277 transitions. [2024-11-24 01:57:48,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 239 transitions, 2574 flow [2024-11-24 01:57:50,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 239 transitions, 2546 flow, removed 10 selfloop flow, removed 1 redundant places. [2024-11-24 01:57:50,169 INFO L231 Difference]: Finished difference. Result has 123 places, 145 transitions, 1847 flow [2024-11-24 01:57:50,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1633, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1847, PETRI_PLACES=123, PETRI_TRANSITIONS=145} [2024-11-24 01:57:50,170 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 73 predicate places. [2024-11-24 01:57:50,170 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 145 transitions, 1847 flow [2024-11-24 01:57:50,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 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-24 01:57:50,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:57:50,171 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] [2024-11-24 01:57:50,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-24 01:57:50,171 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-24 01:57:50,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:57:50,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1576074576, now seen corresponding path program 7 times [2024-11-24 01:57:50,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:57:50,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277484523] [2024-11-24 01:57:50,172 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-24 01:57:50,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:57:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:57:50,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-24 01:57:50,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:57:50,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277484523] [2024-11-24 01:57:50,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277484523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:57:50,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:57:50,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:57:50,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846977945] [2024-11-24 01:57:50,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:57:50,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:57:50,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:57:50,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:57:50,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:57:50,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-11-24 01:57:50,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 145 transitions, 1847 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 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-24 01:57:50,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:57:50,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-11-24 01:57:50,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:57:57,131 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([836] L107-->L112: Formula: (let ((.cse0 (<= 0 (+ |v_thread4Thread1of1ForFork2_plus_#res#1_1| 2147483648))) (.cse1 (<= |v_thread4Thread1of1ForFork2_plus_#res#1_1| 2147483647))) (and (not (= (ite (and (< v_~q2_front~0_95 v_~n2~0_78) (< v_~q2_front~0_95 v_~q2_back~0_86) (<= 0 v_~q2_front~0_95)) 1 0) 0)) .cse0 (= |v_thread4Thread1of1ForFork2_plus_#res#1_1| v_~total~0_91) .cse1 (= (+ v_~q2_front~0_95 1) v_~q2_front~0_94) (not (= (ite (or .cse0 (<= v_~total~0_92 |v_thread4Thread1of1ForFork2_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or .cse1 (<= |v_thread4Thread1of1ForFork2_plus_#res#1_1| v_~total~0_92)) 1 0) 0)) (= |v_thread4Thread1of1ForFork2_plus_#res#1_1| (+ v_~total~0_92 (select (select |v_#memory_int#1_95| v_~q2~0.base_91) (+ v_~q2~0.offset_91 (* 4 v_~q2_front~0_95))))))) InVars {~n2~0=v_~n2~0_78, ~q2~0.offset=v_~q2~0.offset_91, ~q2_front~0=v_~q2_front~0_95, ~q2~0.base=v_~q2~0.base_91, #memory_int#1=|v_#memory_int#1_95|, ~q2_back~0=v_~q2_back~0_86, ~total~0=v_~total~0_92} 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_1|, ~n2~0=v_~n2~0_78, ~q2~0.offset=v_~q2~0.offset_91, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_94, 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_95|, thread4Thread1of1ForFork2_#t~mem10#1=|v_thread4Thread1of1ForFork2_#t~mem10#1_1|, ~total~0=v_~total~0_91, thread4Thread1of1ForFork2_#t~post12#1=|v_thread4Thread1of1ForFork2_#t~post12#1_1|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_1|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_1|, ~q2~0.base=v_~q2~0.base_91, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_1|, ~q2_back~0=v_~q2_back~0_86} 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][313], [Black: 184#(and (or (= ~i~0 0) (< 0 |thread2Thread1of1ForFork3_~cond~1#1|)) (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (< |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 121#(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: 125#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 176#(and (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (and (= ~i~0 0) (<= ~N~0 0))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 201#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 119#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 188#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 68#(<= ~q2_back~0 ~q2_front~0), 131#true, Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 73#(<= ~n1~0 0), Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 79#(<= ~n2~0 0), Black: 140#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 135#(and (= ~i~0 0) (<= ~N~0 0)), Black: 209#(and (= ~j~0 0) (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= 1 ~N~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 133#(and (= ~j~0 0) (= ~i~0 0)), Black: 134#(or (and (= ~i~0 0) (<= ~N~0 0)) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))), 45#L112true, 82#true, Black: 84#(and (= ~j~0 0) (= ~i~0 0)), Black: 91#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 89#(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)), 8#L76true, 172#true, Black: 156#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 162#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 164#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 160#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 166#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 151#true, Black: 106#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 101#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)))), Black: 100#(and (= ~j~0 0) (= ~i~0 0)), 27#L97true, 13#L142-1true, Black: 60#(= ~total~0 0), Black: 182#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 175#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 123#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 118#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 180#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (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)))), 212#true]) [2024-11-24 01:57:57,131 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-24 01:57:57,132 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-24 01:57:57,132 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-24 01:57:57,132 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-24 01:57:57,132 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([835] L115-->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][162], [Black: 121#(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: 184#(and (or (= ~i~0 0) (< 0 |thread2Thread1of1ForFork3_~cond~1#1|)) (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (< |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 125#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 176#(and (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (and (= ~i~0 0) (<= ~N~0 0))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 201#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 119#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 188#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 68#(<= ~q2_back~0 ~q2_front~0), 131#true, Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 73#(<= ~n1~0 0), Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 79#(<= ~n2~0 0), Black: 140#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 135#(and (= ~i~0 0) (<= ~N~0 0)), Black: 209#(and (= ~j~0 0) (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= 1 ~N~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 133#(and (= ~j~0 0) (= ~i~0 0)), Black: 134#(or (and (= ~i~0 0) (<= ~N~0 0)) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))), 15#thread4EXITtrue, 82#true, Black: 84#(and (= ~j~0 0) (= ~i~0 0)), Black: 91#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 89#(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)), 8#L76true, 172#true, Black: 156#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 162#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 164#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 160#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 166#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 151#true, Black: 106#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 101#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)))), Black: 100#(and (= ~j~0 0) (= ~i~0 0)), 27#L97true, 13#L142-1true, Black: 182#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 60#(= ~total~0 0), Black: 175#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 123#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 180#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (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)))), 212#true, Black: 118#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))]) [2024-11-24 01:57:57,133 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-24 01:57:57,133 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-24 01:57:57,133 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-24 01:57:57,133 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-24 01:57:57,244 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([836] L107-->L112: Formula: (let ((.cse0 (<= 0 (+ |v_thread4Thread1of1ForFork2_plus_#res#1_1| 2147483648))) (.cse1 (<= |v_thread4Thread1of1ForFork2_plus_#res#1_1| 2147483647))) (and (not (= (ite (and (< v_~q2_front~0_95 v_~n2~0_78) (< v_~q2_front~0_95 v_~q2_back~0_86) (<= 0 v_~q2_front~0_95)) 1 0) 0)) .cse0 (= |v_thread4Thread1of1ForFork2_plus_#res#1_1| v_~total~0_91) .cse1 (= (+ v_~q2_front~0_95 1) v_~q2_front~0_94) (not (= (ite (or .cse0 (<= v_~total~0_92 |v_thread4Thread1of1ForFork2_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or .cse1 (<= |v_thread4Thread1of1ForFork2_plus_#res#1_1| v_~total~0_92)) 1 0) 0)) (= |v_thread4Thread1of1ForFork2_plus_#res#1_1| (+ v_~total~0_92 (select (select |v_#memory_int#1_95| v_~q2~0.base_91) (+ v_~q2~0.offset_91 (* 4 v_~q2_front~0_95))))))) InVars {~n2~0=v_~n2~0_78, ~q2~0.offset=v_~q2~0.offset_91, ~q2_front~0=v_~q2_front~0_95, ~q2~0.base=v_~q2~0.base_91, #memory_int#1=|v_#memory_int#1_95|, ~q2_back~0=v_~q2_back~0_86, ~total~0=v_~total~0_92} 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_1|, ~n2~0=v_~n2~0_78, ~q2~0.offset=v_~q2~0.offset_91, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_94, 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_95|, thread4Thread1of1ForFork2_#t~mem10#1=|v_thread4Thread1of1ForFork2_#t~mem10#1_1|, ~total~0=v_~total~0_91, thread4Thread1of1ForFork2_#t~post12#1=|v_thread4Thread1of1ForFork2_#t~post12#1_1|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_1|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_1|, ~q2~0.base=v_~q2~0.base_91, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_1|, ~q2_back~0=v_~q2_back~0_86} 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][313], [Black: 184#(and (or (= ~i~0 0) (< 0 |thread2Thread1of1ForFork3_~cond~1#1|)) (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (< |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 121#(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: 125#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 176#(and (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (and (= ~i~0 0) (<= ~N~0 0))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 201#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 119#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 188#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 68#(<= ~q2_back~0 ~q2_front~0), 131#true, Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 73#(<= ~n1~0 0), Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 79#(<= ~n2~0 0), Black: 140#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 135#(and (= ~i~0 0) (<= ~N~0 0)), Black: 209#(and (= ~j~0 0) (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= 1 ~N~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 133#(and (= ~j~0 0) (= ~i~0 0)), Black: 134#(or (and (= ~i~0 0) (<= ~N~0 0)) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))), 45#L112true, 82#true, Black: 84#(and (= ~j~0 0) (= ~i~0 0)), Black: 91#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 89#(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)), 8#L76true, 9#L89true, 172#true, Black: 156#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 162#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 164#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 160#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 166#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 151#true, Black: 106#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 101#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)))), Black: 100#(and (= ~j~0 0) (= ~i~0 0)), 13#L142-1true, Black: 60#(= ~total~0 0), Black: 182#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 175#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 123#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 118#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 180#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (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)))), 212#true]) [2024-11-24 01:57:57,244 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-24 01:57:57,244 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-24 01:57:57,244 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-24 01:57:57,244 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-24 01:57:57,244 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([835] L115-->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][162], [Black: 121#(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: 184#(and (or (= ~i~0 0) (< 0 |thread2Thread1of1ForFork3_~cond~1#1|)) (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (< |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 125#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 176#(and (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (and (= ~i~0 0) (<= ~N~0 0))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 201#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 119#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 188#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 68#(<= ~q2_back~0 ~q2_front~0), 131#true, Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 73#(<= ~n1~0 0), Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 79#(<= ~n2~0 0), Black: 140#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 135#(and (= ~i~0 0) (<= ~N~0 0)), Black: 209#(and (= ~j~0 0) (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= 1 ~N~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 133#(and (= ~j~0 0) (= ~i~0 0)), Black: 134#(or (and (= ~i~0 0) (<= ~N~0 0)) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))), 15#thread4EXITtrue, 82#true, Black: 84#(and (= ~j~0 0) (= ~i~0 0)), Black: 91#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 89#(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)), 9#L89true, 8#L76true, 172#true, Black: 156#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 162#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 164#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 160#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 151#true, Black: 166#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 106#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 101#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)))), Black: 100#(and (= ~j~0 0) (= ~i~0 0)), 13#L142-1true, Black: 182#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 60#(= ~total~0 0), Black: 175#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 123#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 180#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (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: 118#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), 212#true]) [2024-11-24 01:57:57,245 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-24 01:57:57,245 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-24 01:57:57,245 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-24 01:57:57,245 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-24 01:57:57,245 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([836] L107-->L112: Formula: (let ((.cse0 (<= 0 (+ |v_thread4Thread1of1ForFork2_plus_#res#1_1| 2147483648))) (.cse1 (<= |v_thread4Thread1of1ForFork2_plus_#res#1_1| 2147483647))) (and (not (= (ite (and (< v_~q2_front~0_95 v_~n2~0_78) (< v_~q2_front~0_95 v_~q2_back~0_86) (<= 0 v_~q2_front~0_95)) 1 0) 0)) .cse0 (= |v_thread4Thread1of1ForFork2_plus_#res#1_1| v_~total~0_91) .cse1 (= (+ v_~q2_front~0_95 1) v_~q2_front~0_94) (not (= (ite (or .cse0 (<= v_~total~0_92 |v_thread4Thread1of1ForFork2_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or .cse1 (<= |v_thread4Thread1of1ForFork2_plus_#res#1_1| v_~total~0_92)) 1 0) 0)) (= |v_thread4Thread1of1ForFork2_plus_#res#1_1| (+ v_~total~0_92 (select (select |v_#memory_int#1_95| v_~q2~0.base_91) (+ v_~q2~0.offset_91 (* 4 v_~q2_front~0_95))))))) InVars {~n2~0=v_~n2~0_78, ~q2~0.offset=v_~q2~0.offset_91, ~q2_front~0=v_~q2_front~0_95, ~q2~0.base=v_~q2~0.base_91, #memory_int#1=|v_#memory_int#1_95|, ~q2_back~0=v_~q2_back~0_86, ~total~0=v_~total~0_92} 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_1|, ~n2~0=v_~n2~0_78, ~q2~0.offset=v_~q2~0.offset_91, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_94, 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_95|, thread4Thread1of1ForFork2_#t~mem10#1=|v_thread4Thread1of1ForFork2_#t~mem10#1_1|, ~total~0=v_~total~0_91, thread4Thread1of1ForFork2_#t~post12#1=|v_thread4Thread1of1ForFork2_#t~post12#1_1|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_1|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_1|, ~q2~0.base=v_~q2~0.base_91, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_1|, ~q2_back~0=v_~q2_back~0_86} 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][313], [Black: 184#(and (or (= ~i~0 0) (< 0 |thread2Thread1of1ForFork3_~cond~1#1|)) (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (< |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 121#(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: 125#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 176#(and (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (and (= ~i~0 0) (<= ~N~0 0))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 201#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 119#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 188#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 18#thread3EXITtrue, Black: 68#(<= ~q2_back~0 ~q2_front~0), 131#true, Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 73#(<= ~n1~0 0), Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 79#(<= ~n2~0 0), Black: 140#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 135#(and (= ~i~0 0) (<= ~N~0 0)), Black: 209#(and (= ~j~0 0) (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= 1 ~N~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 133#(and (= ~j~0 0) (= ~i~0 0)), Black: 134#(or (and (= ~i~0 0) (<= ~N~0 0)) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))), 45#L112true, 82#true, Black: 84#(and (= ~j~0 0) (= ~i~0 0)), Black: 91#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 89#(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)), 8#L76true, 172#true, Black: 156#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 162#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 164#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 160#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 166#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 151#true, Black: 106#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 101#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)))), Black: 100#(and (= ~j~0 0) (= ~i~0 0)), 13#L142-1true, Black: 60#(= ~total~0 0), Black: 182#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 175#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 123#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 118#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 180#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (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)))), 212#true]) [2024-11-24 01:57:57,246 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-24 01:57:57,246 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-24 01:57:57,246 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-24 01:57:57,246 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-24 01:57:57,246 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([835] L115-->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][162], [Black: 121#(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: 184#(and (or (= ~i~0 0) (< 0 |thread2Thread1of1ForFork3_~cond~1#1|)) (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (< |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 125#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 176#(and (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (and (= ~i~0 0) (<= ~N~0 0))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 201#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 119#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 188#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 18#thread3EXITtrue, Black: 68#(<= ~q2_back~0 ~q2_front~0), 131#true, Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 73#(<= ~n1~0 0), Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 79#(<= ~n2~0 0), Black: 140#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 135#(and (= ~i~0 0) (<= ~N~0 0)), Black: 209#(and (= ~j~0 0) (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= 1 ~N~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 133#(and (= ~j~0 0) (= ~i~0 0)), Black: 134#(or (and (= ~i~0 0) (<= ~N~0 0)) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))), 15#thread4EXITtrue, 82#true, Black: 84#(and (= ~j~0 0) (= ~i~0 0)), Black: 91#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 89#(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)), 8#L76true, 172#true, Black: 156#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 162#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 164#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 160#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 151#true, Black: 166#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 106#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 101#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)))), Black: 100#(and (= ~j~0 0) (= ~i~0 0)), 13#L142-1true, Black: 182#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 60#(= ~total~0 0), Black: 175#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 123#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 180#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (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: 118#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), 212#true]) [2024-11-24 01:57:57,246 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-24 01:57:57,246 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-24 01:57:57,246 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-24 01:57:57,246 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-24 01:57:57,350 INFO L124 PetriNetUnfolderBase]: 27676/41782 cut-off events. [2024-11-24 01:57:57,351 INFO L125 PetriNetUnfolderBase]: For 184785/188084 co-relation queries the response was YES. [2024-11-24 01:57:57,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167682 conditions, 41782 events. 27676/41782 cut-off events. For 184785/188084 co-relation queries the response was YES. Maximal size of possible extension queue 2325. Compared 322138 event pairs, 5435 based on Foata normal form. 1640/39697 useless extension candidates. Maximal degree in co-relation 158608. Up to 28740 conditions per place. [2024-11-24 01:57:57,826 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 137 selfloop transitions, 170 changer transitions 20/352 dead transitions. [2024-11-24 01:57:57,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 352 transitions, 6068 flow [2024-11-24 01:57:57,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 01:57:57,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-24 01:57:57,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 209 transitions. [2024-11-24 01:57:57,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6220238095238095 [2024-11-24 01:57:57,829 INFO L175 Difference]: Start difference. First operand has 123 places, 145 transitions, 1847 flow. Second operand 7 states and 209 transitions. [2024-11-24 01:57:57,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 352 transitions, 6068 flow [2024-11-24 01:58:01,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 352 transitions, 5624 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-24 01:58:01,949 INFO L231 Difference]: Finished difference. Result has 128 places, 270 transitions, 4903 flow [2024-11-24 01:58:01,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1711, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4903, PETRI_PLACES=128, PETRI_TRANSITIONS=270} [2024-11-24 01:58:01,950 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 78 predicate places. [2024-11-24 01:58:01,950 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 270 transitions, 4903 flow [2024-11-24 01:58:01,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 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-24 01:58:01,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:58:01,951 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] [2024-11-24 01:58:01,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-24 01:58:01,951 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-24 01:58:01,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:58:01,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1128590524, now seen corresponding path program 8 times [2024-11-24 01:58:01,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:58:01,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185792493] [2024-11-24 01:58:01,952 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 01:58:01,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:58:01,974 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-24 01:58:01,974 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 01:58:02,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-24 01:58:02,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:58:02,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185792493] [2024-11-24 01:58:02,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185792493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:58:02,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:58:02,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 01:58:02,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739315308] [2024-11-24 01:58:02,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:58:02,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 01:58:02,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:58:02,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 01:58:02,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:58:02,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-11-24 01:58:02,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 270 transitions, 4903 flow. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 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-24 01:58:02,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:58:02,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-11-24 01:58:02,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:58:09,639 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([836] L107-->L112: Formula: (let ((.cse0 (<= 0 (+ |v_thread4Thread1of1ForFork2_plus_#res#1_1| 2147483648))) (.cse1 (<= |v_thread4Thread1of1ForFork2_plus_#res#1_1| 2147483647))) (and (not (= (ite (and (< v_~q2_front~0_95 v_~n2~0_78) (< v_~q2_front~0_95 v_~q2_back~0_86) (<= 0 v_~q2_front~0_95)) 1 0) 0)) .cse0 (= |v_thread4Thread1of1ForFork2_plus_#res#1_1| v_~total~0_91) .cse1 (= (+ v_~q2_front~0_95 1) v_~q2_front~0_94) (not (= (ite (or .cse0 (<= v_~total~0_92 |v_thread4Thread1of1ForFork2_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or .cse1 (<= |v_thread4Thread1of1ForFork2_plus_#res#1_1| v_~total~0_92)) 1 0) 0)) (= |v_thread4Thread1of1ForFork2_plus_#res#1_1| (+ v_~total~0_92 (select (select |v_#memory_int#1_95| v_~q2~0.base_91) (+ v_~q2~0.offset_91 (* 4 v_~q2_front~0_95))))))) InVars {~n2~0=v_~n2~0_78, ~q2~0.offset=v_~q2~0.offset_91, ~q2_front~0=v_~q2_front~0_95, ~q2~0.base=v_~q2~0.base_91, #memory_int#1=|v_#memory_int#1_95|, ~q2_back~0=v_~q2_back~0_86, ~total~0=v_~total~0_92} 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_1|, ~n2~0=v_~n2~0_78, ~q2~0.offset=v_~q2~0.offset_91, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_94, 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_95|, thread4Thread1of1ForFork2_#t~mem10#1=|v_thread4Thread1of1ForFork2_#t~mem10#1_1|, ~total~0=v_~total~0_91, thread4Thread1of1ForFork2_#t~post12#1=|v_thread4Thread1of1ForFork2_#t~post12#1_1|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_1|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_1|, ~q2~0.base=v_~q2~0.base_91, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_1|, ~q2_back~0=v_~q2_back~0_86} 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][288], [Black: 184#(and (or (= ~i~0 0) (< 0 |thread2Thread1of1ForFork3_~cond~1#1|)) (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (< |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 121#(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: 125#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 176#(and (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (and (= ~i~0 0) (<= ~N~0 0))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 201#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 119#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 188#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 68#(<= ~q2_back~0 ~q2_front~0), 229#true, 131#true, Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 73#(<= ~n1~0 0), Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 79#(<= ~n2~0 0), Black: 140#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 135#(and (= ~i~0 0) (<= ~N~0 0)), Black: 209#(and (= ~j~0 0) (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= 1 ~N~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 133#(and (= ~j~0 0) (= ~i~0 0)), Black: 134#(or (and (= ~i~0 0) (<= ~N~0 0)) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))), 45#L112true, Black: 84#(and (= ~j~0 0) (= ~i~0 0)), Black: 91#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 214#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0)), Black: 89#(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: 221#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), 8#L76true, Black: 223#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= 1 ~N~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 219#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0))), Black: 217#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 172#true, Black: 156#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 162#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 164#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 160#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 151#true, Black: 166#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 106#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 101#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)))), 27#L97true, 13#L142-1true, Black: 60#(= ~total~0 0), Black: 182#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 175#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 123#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 118#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 180#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (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)))), 212#true]) [2024-11-24 01:58:09,639 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-24 01:58:09,639 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-24 01:58:09,639 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-24 01:58:09,639 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-24 01:58:09,640 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([835] L115-->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][160], [Black: 184#(and (or (= ~i~0 0) (< 0 |thread2Thread1of1ForFork3_~cond~1#1|)) (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (< |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 121#(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: 125#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 176#(and (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (and (= ~i~0 0) (<= ~N~0 0))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 201#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 119#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 188#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 68#(<= ~q2_back~0 ~q2_front~0), 229#true, 131#true, Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 73#(<= ~n1~0 0), Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 79#(<= ~n2~0 0), Black: 140#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 135#(and (= ~i~0 0) (<= ~N~0 0)), Black: 209#(and (= ~j~0 0) (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= 1 ~N~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 133#(and (= ~j~0 0) (= ~i~0 0)), Black: 134#(or (and (= ~i~0 0) (<= ~N~0 0)) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))), 15#thread4EXITtrue, Black: 84#(and (= ~j~0 0) (= ~i~0 0)), Black: 91#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 214#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0)), Black: 89#(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: 221#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 223#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= 1 ~N~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 8#L76true, Black: 219#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0))), Black: 217#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 172#true, Black: 156#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 162#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 164#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 160#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 166#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 151#true, Black: 106#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 101#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)))), 27#L97true, 13#L142-1true, Black: 60#(= ~total~0 0), Black: 182#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 175#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 123#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 180#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (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: 118#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), 212#true]) [2024-11-24 01:58:09,640 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-24 01:58:09,640 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-24 01:58:09,640 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-24 01:58:09,640 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-24 01:58:09,772 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([836] L107-->L112: Formula: (let ((.cse0 (<= 0 (+ |v_thread4Thread1of1ForFork2_plus_#res#1_1| 2147483648))) (.cse1 (<= |v_thread4Thread1of1ForFork2_plus_#res#1_1| 2147483647))) (and (not (= (ite (and (< v_~q2_front~0_95 v_~n2~0_78) (< v_~q2_front~0_95 v_~q2_back~0_86) (<= 0 v_~q2_front~0_95)) 1 0) 0)) .cse0 (= |v_thread4Thread1of1ForFork2_plus_#res#1_1| v_~total~0_91) .cse1 (= (+ v_~q2_front~0_95 1) v_~q2_front~0_94) (not (= (ite (or .cse0 (<= v_~total~0_92 |v_thread4Thread1of1ForFork2_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or .cse1 (<= |v_thread4Thread1of1ForFork2_plus_#res#1_1| v_~total~0_92)) 1 0) 0)) (= |v_thread4Thread1of1ForFork2_plus_#res#1_1| (+ v_~total~0_92 (select (select |v_#memory_int#1_95| v_~q2~0.base_91) (+ v_~q2~0.offset_91 (* 4 v_~q2_front~0_95))))))) InVars {~n2~0=v_~n2~0_78, ~q2~0.offset=v_~q2~0.offset_91, ~q2_front~0=v_~q2_front~0_95, ~q2~0.base=v_~q2~0.base_91, #memory_int#1=|v_#memory_int#1_95|, ~q2_back~0=v_~q2_back~0_86, ~total~0=v_~total~0_92} 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_1|, ~n2~0=v_~n2~0_78, ~q2~0.offset=v_~q2~0.offset_91, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_94, 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_95|, thread4Thread1of1ForFork2_#t~mem10#1=|v_thread4Thread1of1ForFork2_#t~mem10#1_1|, ~total~0=v_~total~0_91, thread4Thread1of1ForFork2_#t~post12#1=|v_thread4Thread1of1ForFork2_#t~post12#1_1|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_1|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_1|, ~q2~0.base=v_~q2~0.base_91, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_1|, ~q2_back~0=v_~q2_back~0_86} 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][288], [Black: 184#(and (or (= ~i~0 0) (< 0 |thread2Thread1of1ForFork3_~cond~1#1|)) (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (< |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 121#(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: 125#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 176#(and (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (and (= ~i~0 0) (<= ~N~0 0))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 201#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 119#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 188#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 68#(<= ~q2_back~0 ~q2_front~0), 229#true, 131#true, Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 73#(<= ~n1~0 0), Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 79#(<= ~n2~0 0), Black: 140#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 135#(and (= ~i~0 0) (<= ~N~0 0)), Black: 209#(and (= ~j~0 0) (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= 1 ~N~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 133#(and (= ~j~0 0) (= ~i~0 0)), Black: 134#(or (and (= ~i~0 0) (<= ~N~0 0)) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))), 45#L112true, Black: 84#(and (= ~j~0 0) (= ~i~0 0)), Black: 91#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 214#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0)), Black: 89#(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: 221#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), 8#L76true, Black: 223#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= 1 ~N~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 9#L89true, Black: 219#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0))), Black: 217#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 172#true, Black: 156#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 162#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 164#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 160#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 151#true, Black: 166#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 106#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 101#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)))), 13#L142-1true, Black: 60#(= ~total~0 0), Black: 182#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 175#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 123#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 118#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 180#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (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)))), 212#true]) [2024-11-24 01:58:09,772 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-24 01:58:09,772 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-24 01:58:09,772 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-24 01:58:09,772 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-24 01:58:09,773 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([835] L115-->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][160], [Black: 184#(and (or (= ~i~0 0) (< 0 |thread2Thread1of1ForFork3_~cond~1#1|)) (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (< |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 121#(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: 125#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 176#(and (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (and (= ~i~0 0) (<= ~N~0 0))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 201#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 119#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 188#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 68#(<= ~q2_back~0 ~q2_front~0), 229#true, 131#true, Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 73#(<= ~n1~0 0), Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 79#(<= ~n2~0 0), Black: 140#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 135#(and (= ~i~0 0) (<= ~N~0 0)), Black: 209#(and (= ~j~0 0) (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= 1 ~N~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 133#(and (= ~j~0 0) (= ~i~0 0)), Black: 134#(or (and (= ~i~0 0) (<= ~N~0 0)) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))), 15#thread4EXITtrue, Black: 84#(and (= ~j~0 0) (= ~i~0 0)), Black: 91#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 214#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0)), Black: 89#(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: 221#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 223#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= 1 ~N~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 9#L89true, 8#L76true, Black: 219#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0))), Black: 217#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 172#true, Black: 156#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 162#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 164#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 160#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 166#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 151#true, Black: 106#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 101#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)))), 13#L142-1true, Black: 60#(= ~total~0 0), Black: 182#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 175#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 123#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 180#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (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: 118#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), 212#true]) [2024-11-24 01:58:09,773 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-24 01:58:09,773 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-24 01:58:09,773 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-24 01:58:09,773 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-24 01:58:09,774 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([836] L107-->L112: Formula: (let ((.cse0 (<= 0 (+ |v_thread4Thread1of1ForFork2_plus_#res#1_1| 2147483648))) (.cse1 (<= |v_thread4Thread1of1ForFork2_plus_#res#1_1| 2147483647))) (and (not (= (ite (and (< v_~q2_front~0_95 v_~n2~0_78) (< v_~q2_front~0_95 v_~q2_back~0_86) (<= 0 v_~q2_front~0_95)) 1 0) 0)) .cse0 (= |v_thread4Thread1of1ForFork2_plus_#res#1_1| v_~total~0_91) .cse1 (= (+ v_~q2_front~0_95 1) v_~q2_front~0_94) (not (= (ite (or .cse0 (<= v_~total~0_92 |v_thread4Thread1of1ForFork2_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or .cse1 (<= |v_thread4Thread1of1ForFork2_plus_#res#1_1| v_~total~0_92)) 1 0) 0)) (= |v_thread4Thread1of1ForFork2_plus_#res#1_1| (+ v_~total~0_92 (select (select |v_#memory_int#1_95| v_~q2~0.base_91) (+ v_~q2~0.offset_91 (* 4 v_~q2_front~0_95))))))) InVars {~n2~0=v_~n2~0_78, ~q2~0.offset=v_~q2~0.offset_91, ~q2_front~0=v_~q2_front~0_95, ~q2~0.base=v_~q2~0.base_91, #memory_int#1=|v_#memory_int#1_95|, ~q2_back~0=v_~q2_back~0_86, ~total~0=v_~total~0_92} 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_1|, ~n2~0=v_~n2~0_78, ~q2~0.offset=v_~q2~0.offset_91, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_94, 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_95|, thread4Thread1of1ForFork2_#t~mem10#1=|v_thread4Thread1of1ForFork2_#t~mem10#1_1|, ~total~0=v_~total~0_91, thread4Thread1of1ForFork2_#t~post12#1=|v_thread4Thread1of1ForFork2_#t~post12#1_1|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_1|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_1|, ~q2~0.base=v_~q2~0.base_91, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_1|, ~q2_back~0=v_~q2_back~0_86} 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][288], [Black: 184#(and (or (= ~i~0 0) (< 0 |thread2Thread1of1ForFork3_~cond~1#1|)) (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (< |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 121#(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: 125#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 176#(and (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (and (= ~i~0 0) (<= ~N~0 0))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 201#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 119#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 188#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 18#thread3EXITtrue, Black: 68#(<= ~q2_back~0 ~q2_front~0), 229#true, 131#true, Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 73#(<= ~n1~0 0), Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 79#(<= ~n2~0 0), Black: 140#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 135#(and (= ~i~0 0) (<= ~N~0 0)), Black: 209#(and (= ~j~0 0) (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= 1 ~N~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 133#(and (= ~j~0 0) (= ~i~0 0)), Black: 134#(or (and (= ~i~0 0) (<= ~N~0 0)) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))), 45#L112true, Black: 84#(and (= ~j~0 0) (= ~i~0 0)), Black: 91#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 214#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0)), Black: 89#(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: 221#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), 8#L76true, Black: 223#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= 1 ~N~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 219#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0))), Black: 217#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 172#true, Black: 156#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 162#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 164#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 160#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 151#true, Black: 166#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 106#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 101#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)))), 13#L142-1true, Black: 60#(= ~total~0 0), Black: 182#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 175#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 123#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 118#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 180#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (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)))), 212#true]) [2024-11-24 01:58:09,774 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-24 01:58:09,774 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-24 01:58:09,774 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-24 01:58:09,774 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-24 01:58:09,774 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([835] L115-->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][160], [Black: 184#(and (or (= ~i~0 0) (< 0 |thread2Thread1of1ForFork3_~cond~1#1|)) (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (< |thread1Thread1of1ForFork1_~cond~0#1| 1)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 121#(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: 125#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 176#(and (or (< 0 |thread2Thread1of1ForFork3_~cond~1#1|) (and (= ~i~0 0) (<= ~N~0 0))) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 201#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 119#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 188#(and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 18#thread3EXITtrue, Black: 68#(<= ~q2_back~0 ~q2_front~0), 229#true, 131#true, Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 73#(<= ~n1~0 0), Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 79#(<= ~n2~0 0), Black: 140#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 135#(and (= ~i~0 0) (<= ~N~0 0)), Black: 209#(and (= ~j~0 0) (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= 1 ~N~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 133#(and (= ~j~0 0) (= ~i~0 0)), Black: 134#(or (and (= ~i~0 0) (<= ~N~0 0)) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))), 15#thread4EXITtrue, Black: 84#(and (= ~j~0 0) (= ~i~0 0)), Black: 91#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 214#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0)), Black: 89#(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: 221#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0)), Black: 223#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= 1 ~N~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 8#L76true, Black: 219#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0))), Black: 217#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 172#true, Black: 156#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 162#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 164#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 160#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 166#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 151#true, Black: 106#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 101#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)))), 13#L142-1true, Black: 60#(= ~total~0 0), Black: 182#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)), Black: 175#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 123#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 180#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~j~0 ~N~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (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: 118#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), 212#true]) [2024-11-24 01:58:09,774 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-24 01:58:09,774 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-24 01:58:09,774 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-24 01:58:09,775 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-24 01:58:09,888 INFO L124 PetriNetUnfolderBase]: 27963/42839 cut-off events. [2024-11-24 01:58:09,888 INFO L125 PetriNetUnfolderBase]: For 197530/200471 co-relation queries the response was YES. [2024-11-24 01:58:10,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179926 conditions, 42839 events. 27963/42839 cut-off events. For 197530/200471 co-relation queries the response was YES. Maximal size of possible extension queue 2416. Compared 340051 event pairs, 6188 based on Foata normal form. 1390/42978 useless extension candidates. Maximal degree in co-relation 170293. Up to 32030 conditions per place. [2024-11-24 01:58:10,345 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 103 selfloop transitions, 167 changer transitions 32/327 dead transitions. [2024-11-24 01:58:10,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 327 transitions, 5806 flow [2024-11-24 01:58:10,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 01:58:10,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-24 01:58:10,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 209 transitions. [2024-11-24 01:58:10,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6220238095238095 [2024-11-24 01:58:10,347 INFO L175 Difference]: Start difference. First operand has 128 places, 270 transitions, 4903 flow. Second operand 7 states and 209 transitions. [2024-11-24 01:58:10,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 327 transitions, 5806 flow [2024-11-24 01:58:18,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 327 transitions, 5634 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 01:58:18,223 INFO L231 Difference]: Finished difference. Result has 135 places, 270 transitions, 5089 flow [2024-11-24 01:58:18,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4735, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5089, PETRI_PLACES=135, PETRI_TRANSITIONS=270} [2024-11-24 01:58:18,224 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 85 predicate places. [2024-11-24 01:58:18,224 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 270 transitions, 5089 flow [2024-11-24 01:58:18,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 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-24 01:58:18,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:58:18,225 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] [2024-11-24 01:58:18,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-24 01:58:18,225 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-24 01:58:18,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:58:18,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1070355242, now seen corresponding path program 9 times [2024-11-24 01:58:18,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:58:18,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668252511] [2024-11-24 01:58:18,226 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-24 01:58:18,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:58:18,249 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-24 01:58:18,249 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 01:58:18,651 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-24 01:58:18,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:58:18,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668252511] [2024-11-24 01:58:18,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668252511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:58:18,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:58:18,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:58:18,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168405039] [2024-11-24 01:58:18,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:58:18,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:58:18,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:58:18,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:58:18,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:58:18,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-11-24 01:58:18,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 270 transitions, 5089 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 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-24 01:58:18,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:58:18,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-11-24 01:58:18,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:58:28,799 INFO L124 PetriNetUnfolderBase]: 31358/50454 cut-off events. [2024-11-24 01:58:28,799 INFO L125 PetriNetUnfolderBase]: For 255290/259758 co-relation queries the response was YES. [2024-11-24 01:58:29,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210041 conditions, 50454 events. 31358/50454 cut-off events. For 255290/259758 co-relation queries the response was YES. Maximal size of possible extension queue 2959. Compared 442049 event pairs, 7496 based on Foata normal form. 1886/51271 useless extension candidates. Maximal degree in co-relation 200067. Up to 32277 conditions per place. [2024-11-24 01:58:29,317 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 140 selfloop transitions, 248 changer transitions 14/432 dead transitions. [2024-11-24 01:58:29,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 432 transitions, 8558 flow [2024-11-24 01:58:29,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 01:58:29,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-24 01:58:29,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 220 transitions. [2024-11-24 01:58:29,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2024-11-24 01:58:29,319 INFO L175 Difference]: Start difference. First operand has 135 places, 270 transitions, 5089 flow. Second operand 7 states and 220 transitions. [2024-11-24 01:58:29,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 432 transitions, 8558 flow [2024-11-24 01:58:37,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 432 transitions, 8288 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-24 01:58:37,561 INFO L231 Difference]: Finished difference. Result has 139 places, 352 transitions, 7739 flow [2024-11-24 01:58:37,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4907, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7739, PETRI_PLACES=139, PETRI_TRANSITIONS=352} [2024-11-24 01:58:37,562 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 89 predicate places. [2024-11-24 01:58:37,562 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 352 transitions, 7739 flow [2024-11-24 01:58:37,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 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-24 01:58:37,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:58:37,563 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] [2024-11-24 01:58:37,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-24 01:58:37,563 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-24 01:58:37,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:58:37,564 INFO L85 PathProgramCache]: Analyzing trace with hash 2070419934, now seen corresponding path program 10 times [2024-11-24 01:58:37,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:58:37,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008167211] [2024-11-24 01:58:37,565 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-24 01:58:37,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:58:37,600 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-24 01:58:37,601 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 01:58:37,919 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-24 01:58:37,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:58:37,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008167211] [2024-11-24 01:58:37,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008167211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:58:37,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:58:37,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:58:37,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159554066] [2024-11-24 01:58:37,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:58:37,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:58:37,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:58:37,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:58:37,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:58:38,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-11-24 01:58:38,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 352 transitions, 7739 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 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-24 01:58:38,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:58:38,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-11-24 01:58:38,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand