./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d2c89f010e0f73e8ba7e81bb150b82b70d39c0827c0d616dd2c3347839d51e01 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:12:04,804 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:12:04,852 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:12:04,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:12:04,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:12:04,871 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:12:04,871 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:12:04,871 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:12:04,871 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:12:04,871 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:12:04,872 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:12:04,872 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:12:04,872 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:12:04,872 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:12:04,872 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:12:04,872 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:12:04,872 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:12:04,872 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:12:04,872 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:12:04,872 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:12:04,872 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:12:04,872 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:12:04,872 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:12:04,873 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:12:04,873 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:12:04,873 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:12:04,873 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:12:04,873 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:12:04,873 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:12:04,873 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:12:04,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:12:04,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:12:04,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:12:04,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:12:04,874 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:12:04,874 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:12:04,874 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:12:04,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:12:04,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:12:04,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:12:04,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:12:04,874 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:12:04,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:12:04,874 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:12:04,874 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:12:04,874 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:12:04,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:12:04,875 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d2c89f010e0f73e8ba7e81bb150b82b70d39c0827c0d616dd2c3347839d51e01 [2025-01-10 01:12:05,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:12:05,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:12:05,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:12:05,088 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:12:05,089 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:12:05,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c [2025-01-10 01:12:06,252 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8c7d43f34/d2099e53370543fe853b2dd22bf00903/FLAGacbb8729b [2025-01-10 01:12:06,554 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:12:06,554 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c [2025-01-10 01:12:06,565 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8c7d43f34/d2099e53370543fe853b2dd22bf00903/FLAGacbb8729b [2025-01-10 01:12:06,615 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8c7d43f34/d2099e53370543fe853b2dd22bf00903 [2025-01-10 01:12:06,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:12:06,617 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:12:06,618 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:12:06,618 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:12:06,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:12:06,624 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:12:06" (1/1) ... [2025-01-10 01:12:06,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2140d6ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:06, skipping insertion in model container [2025-01-10 01:12:06,624 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:12:06" (1/1) ... [2025-01-10 01:12:06,639 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:12:06,766 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:12:06,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:12:06,777 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:12:06,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:12:06,811 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:12:06,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:06 WrapperNode [2025-01-10 01:12:06,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:12:06,813 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:12:06,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:12:06,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:12:06,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:06" (1/1) ... [2025-01-10 01:12:06,827 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:06" (1/1) ... [2025-01-10 01:12:06,848 INFO L138 Inliner]: procedures = 24, calls = 41, calls flagged for inlining = 17, calls inlined = 19, statements flattened = 226 [2025-01-10 01:12:06,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:12:06,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:12:06,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:12:06,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:12:06,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:06" (1/1) ... [2025-01-10 01:12:06,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:06" (1/1) ... [2025-01-10 01:12:06,861 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:06" (1/1) ... [2025-01-10 01:12:06,874 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 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]. [2025-01-10 01:12:06,874 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:06" (1/1) ... [2025-01-10 01:12:06,874 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:06" (1/1) ... [2025-01-10 01:12:06,884 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:06" (1/1) ... [2025-01-10 01:12:06,885 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:06" (1/1) ... [2025-01-10 01:12:06,888 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:06" (1/1) ... [2025-01-10 01:12:06,889 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:06" (1/1) ... [2025-01-10 01:12:06,890 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:06" (1/1) ... [2025-01-10 01:12:06,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:12:06,892 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:12:06,892 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:12:06,892 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:12:06,893 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:06" (1/1) ... [2025-01-10 01:12:06,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:12:06,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:06,926 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:12:06,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:12:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:12:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:12:06,959 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:12:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:12:06,959 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:12:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:12:06,960 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:12:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:12:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:12:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:12:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:12:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 01:12:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 01:12:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:12:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:12:06,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:12:06,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:12:06,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:12:06,962 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 01:12:07,109 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:12:07,110 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:12:07,453 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:12:07,453 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:12:07,738 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:12:07,739 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 01:12:07,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:12:07 BoogieIcfgContainer [2025-01-10 01:12:07,740 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:12:07,742 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:12:07,743 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:12:07,746 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:12:07,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:12:06" (1/3) ... [2025-01-10 01:12:07,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150108d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:12:07, skipping insertion in model container [2025-01-10 01:12:07,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:06" (2/3) ... [2025-01-10 01:12:07,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150108d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:12:07, skipping insertion in model container [2025-01-10 01:12:07,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:12:07" (3/3) ... [2025-01-10 01:12:07,749 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-3.wvr.c [2025-01-10 01:12:07,760 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:12:07,761 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-queue-add-3.wvr.c that has 4 procedures, 54 locations, 1 initial locations, 5 loop locations, and 16 error locations. [2025-01-10 01:12:07,761 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:12:07,810 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 01:12:07,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 60 transitions, 141 flow [2025-01-10 01:12:07,873 INFO L124 PetriNetUnfolderBase]: 7/57 cut-off events. [2025-01-10 01:12:07,875 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:12:07,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 57 events. 7/57 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 161 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-01-10 01:12:07,877 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 60 transitions, 141 flow [2025-01-10 01:12:07,879 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 56 transitions, 130 flow [2025-01-10 01:12:07,884 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:12:07,890 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@79d8665d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:12:07,891 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-01-10 01:12:07,893 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:12:07,893 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:12:07,893 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:12:07,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:07,894 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:12:07,894 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:12:07,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:07,897 INFO L85 PathProgramCache]: Analyzing trace with hash 703311, now seen corresponding path program 1 times [2025-01-10 01:12:07,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:07,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017578555] [2025-01-10 01:12:07,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:07,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:07,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:12:07,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:12:07,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:07,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:08,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:12:08,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:08,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017578555] [2025-01-10 01:12:08,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017578555] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:08,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:08,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:12:08,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860192909] [2025-01-10 01:12:08,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:08,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:12:08,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:08,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:12:08,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:12:08,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-01-10 01:12:08,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) [2025-01-10 01:12:08,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:08,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-01-10 01:12:08,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:08,737 INFO L124 PetriNetUnfolderBase]: 3071/4843 cut-off events. [2025-01-10 01:12:08,737 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2025-01-10 01:12:08,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9319 conditions, 4843 events. 3071/4843 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 28727 event pairs, 2731 based on Foata normal form. 1/3085 useless extension candidates. Maximal degree in co-relation 8912. Up to 4203 conditions per place. [2025-01-10 01:12:08,772 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 38 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2025-01-10 01:12:08,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 50 transitions, 198 flow [2025-01-10 01:12:08,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:12:08,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:12:08,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-01-10 01:12:08,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2025-01-10 01:12:08,782 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 130 flow. Second operand 3 states and 87 transitions. [2025-01-10 01:12:08,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 50 transitions, 198 flow [2025-01-10 01:12:08,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 186 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:12:08,791 INFO L231 Difference]: Finished difference. Result has 51 places, 50 transitions, 110 flow [2025-01-10 01:12:08,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2025-01-10 01:12:08,795 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -8 predicate places. [2025-01-10 01:12:08,795 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 110 flow [2025-01-10 01:12:08,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) [2025-01-10 01:12:08,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:08,795 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:12:08,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:12:08,796 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:12:08,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:08,796 INFO L85 PathProgramCache]: Analyzing trace with hash 703312, now seen corresponding path program 1 times [2025-01-10 01:12:08,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:08,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678167550] [2025-01-10 01:12:08,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:08,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:08,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:12:08,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:12:08,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:08,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:09,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:12:09,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:09,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678167550] [2025-01-10 01:12:09,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678167550] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:09,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:09,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:12:09,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105886697] [2025-01-10 01:12:09,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:09,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:12:09,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:09,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:12:09,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:12:09,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-01-10 01:12:09,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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) [2025-01-10 01:12:09,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:09,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-01-10 01:12:09,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:09,639 INFO L124 PetriNetUnfolderBase]: 3072/4846 cut-off events. [2025-01-10 01:12:09,639 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-01-10 01:12:09,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9165 conditions, 4846 events. 3072/4846 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 28723 event pairs, 2731 based on Foata normal form. 0/3085 useless extension candidates. Maximal degree in co-relation 9136. Up to 4212 conditions per place. [2025-01-10 01:12:09,666 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 41 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2025-01-10 01:12:09,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 53 transitions, 206 flow [2025-01-10 01:12:09,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:12:09,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:12:09,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-01-10 01:12:09,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.425 [2025-01-10 01:12:09,669 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 110 flow. Second operand 4 states and 102 transitions. [2025-01-10 01:12:09,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 53 transitions, 206 flow [2025-01-10 01:12:09,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:12:09,673 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 133 flow [2025-01-10 01:12:09,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2025-01-10 01:12:09,675 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -5 predicate places. [2025-01-10 01:12:09,675 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 133 flow [2025-01-10 01:12:09,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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) [2025-01-10 01:12:09,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:09,675 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:12:09,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:12:09,676 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:12:09,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:09,676 INFO L85 PathProgramCache]: Analyzing trace with hash 21803357, now seen corresponding path program 1 times [2025-01-10 01:12:09,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:09,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435623504] [2025-01-10 01:12:09,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:09,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:09,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:12:09,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:12:09,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:09,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:09,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:12:09,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:09,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435623504] [2025-01-10 01:12:09,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435623504] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:09,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:09,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:12:09,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551563904] [2025-01-10 01:12:09,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:09,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:12:09,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:09,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:12:09,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:12:09,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-01-10 01:12:09,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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) [2025-01-10 01:12:09,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:09,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-01-10 01:12:09,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:10,212 INFO L124 PetriNetUnfolderBase]: 3073/4849 cut-off events. [2025-01-10 01:12:10,212 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-01-10 01:12:10,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9182 conditions, 4849 events. 3073/4849 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 28716 event pairs, 2731 based on Foata normal form. 0/3087 useless extension candidates. Maximal degree in co-relation 9157. Up to 4211 conditions per place. [2025-01-10 01:12:10,233 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 41 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2025-01-10 01:12:10,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 56 transitions, 235 flow [2025-01-10 01:12:10,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:12:10,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:12:10,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2025-01-10 01:12:10,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39666666666666667 [2025-01-10 01:12:10,235 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 133 flow. Second operand 5 states and 119 transitions. [2025-01-10 01:12:10,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 56 transitions, 235 flow [2025-01-10 01:12:10,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:12:10,236 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 167 flow [2025-01-10 01:12:10,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2025-01-10 01:12:10,237 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 0 predicate places. [2025-01-10 01:12:10,237 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 167 flow [2025-01-10 01:12:10,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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) [2025-01-10 01:12:10,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:10,237 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:12:10,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:12:10,237 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:12:10,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:10,238 INFO L85 PathProgramCache]: Analyzing trace with hash 675905756, now seen corresponding path program 1 times [2025-01-10 01:12:10,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:10,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314962220] [2025-01-10 01:12:10,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:10,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:10,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:12:10,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:12:10,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:10,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:12:10,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:10,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314962220] [2025-01-10 01:12:10,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314962220] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:10,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333938697] [2025-01-10 01:12:10,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:10,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:10,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:10,437 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:12:10,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:12:10,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:12:10,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:12:10,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:10,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:10,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 01:12:10,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:10,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-01-10 01:12:10,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:12:10,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:11,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:12:11,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333938697] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:12:11,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:12:11,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:12:11,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840531770] [2025-01-10 01:12:11,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:12:11,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:12:11,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:11,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:12:11,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:12:11,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-01-10 01:12:11,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 167 flow. Second operand has 11 states, 11 states have (on average 15.363636363636363) internal successors, (169), 11 states have internal predecessors, (169), 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) [2025-01-10 01:12:11,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:11,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-01-10 01:12:11,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:11,535 INFO L124 PetriNetUnfolderBase]: 3073/4848 cut-off events. [2025-01-10 01:12:11,535 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-10 01:12:11,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9195 conditions, 4848 events. 3073/4848 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 28751 event pairs, 2731 based on Foata normal form. 0/3089 useless extension candidates. Maximal degree in co-relation 9167. Up to 4211 conditions per place. [2025-01-10 01:12:11,561 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 40 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2025-01-10 01:12:11,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 55 transitions, 257 flow [2025-01-10 01:12:11,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:12:11,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:12:11,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2025-01-10 01:12:11,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2025-01-10 01:12:11,563 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 167 flow. Second operand 6 states and 129 transitions. [2025-01-10 01:12:11,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 55 transitions, 257 flow [2025-01-10 01:12:11,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 55 transitions, 256 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:12:11,565 INFO L231 Difference]: Finished difference. Result has 62 places, 55 transitions, 176 flow [2025-01-10 01:12:11,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=62, PETRI_TRANSITIONS=55} [2025-01-10 01:12:11,565 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 3 predicate places. [2025-01-10 01:12:11,565 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 176 flow [2025-01-10 01:12:11,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.363636363636363) internal successors, (169), 11 states have internal predecessors, (169), 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) [2025-01-10 01:12:11,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:11,566 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 01:12:11,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:12:11,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:11,770 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:12:11,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:11,770 INFO L85 PathProgramCache]: Analyzing trace with hash -521788111, now seen corresponding path program 1 times [2025-01-10 01:12:11,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:11,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381427620] [2025-01-10 01:12:11,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:11,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:11,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:12:11,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:12:11,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:11,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:11,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:12:11,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:11,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381427620] [2025-01-10 01:12:11,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381427620] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:11,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704946718] [2025-01-10 01:12:11,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:11,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:11,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:11,945 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:12:11,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:12:11,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:12:12,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:12:12,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:12,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:12,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:12:12,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:12,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-01-10 01:12:12,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:12:12,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:12:12,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704946718] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:12:12,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:12:12,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-01-10 01:12:12,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883107660] [2025-01-10 01:12:12,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:12:12,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:12:12,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:12,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:12:12,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:12:12,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-01-10 01:12:12,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 176 flow. Second operand has 13 states, 13 states have (on average 15.307692307692308) internal successors, (199), 13 states have internal predecessors, (199), 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) [2025-01-10 01:12:12,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:12,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-01-10 01:12:12,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:13,139 INFO L124 PetriNetUnfolderBase]: 3075/4853 cut-off events. [2025-01-10 01:12:13,140 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-01-10 01:12:13,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9221 conditions, 4853 events. 3075/4853 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 28758 event pairs, 2731 based on Foata normal form. 0/3094 useless extension candidates. Maximal degree in co-relation 9175. Up to 4204 conditions per place. [2025-01-10 01:12:13,158 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 34 selfloop transitions, 18 changer transitions 0/60 dead transitions. [2025-01-10 01:12:13,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 60 transitions, 309 flow [2025-01-10 01:12:13,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:12:13,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:12:13,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions. [2025-01-10 01:12:13,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-01-10 01:12:13,161 INFO L175 Difference]: Start difference. First operand has 62 places, 55 transitions, 176 flow. Second operand 9 states and 180 transitions. [2025-01-10 01:12:13,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 60 transitions, 309 flow [2025-01-10 01:12:13,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 262 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-01-10 01:12:13,164 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 194 flow [2025-01-10 01:12:13,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=194, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2025-01-10 01:12:13,165 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 2 predicate places. [2025-01-10 01:12:13,165 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 194 flow [2025-01-10 01:12:13,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 15.307692307692308) internal successors, (199), 13 states have internal predecessors, (199), 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) [2025-01-10 01:12:13,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:13,166 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:13,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:12:13,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:13,367 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:12:13,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:13,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1008115055, now seen corresponding path program 1 times [2025-01-10 01:12:13,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:13,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242720759] [2025-01-10 01:12:13,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:13,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:13,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:12:13,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:12:13,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:13,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:13,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:12:13,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:13,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242720759] [2025-01-10 01:12:13,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242720759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:13,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:13,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:12:13,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634534400] [2025-01-10 01:12:13,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:13,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:12:13,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:13,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:12:13,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:12:13,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-01-10 01:12:13,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 194 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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) [2025-01-10 01:12:13,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:13,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-01-10 01:12:13,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:13,786 INFO L124 PetriNetUnfolderBase]: 3216/5117 cut-off events. [2025-01-10 01:12:13,786 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-01-10 01:12:13,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9732 conditions, 5117 events. 3216/5117 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 30484 event pairs, 2858 based on Foata normal form. 101/3422 useless extension candidates. Maximal degree in co-relation 9160. Up to 4218 conditions per place. [2025-01-10 01:12:13,803 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 71 selfloop transitions, 3 changer transitions 1/83 dead transitions. [2025-01-10 01:12:13,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 83 transitions, 431 flow [2025-01-10 01:12:13,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:12:13,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:12:13,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2025-01-10 01:12:13,804 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5541666666666667 [2025-01-10 01:12:13,804 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 194 flow. Second operand 4 states and 133 transitions. [2025-01-10 01:12:13,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 83 transitions, 431 flow [2025-01-10 01:12:13,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 83 transitions, 378 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-01-10 01:12:13,806 INFO L231 Difference]: Finished difference. Result has 60 places, 60 transitions, 186 flow [2025-01-10 01:12:13,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=60, PETRI_TRANSITIONS=60} [2025-01-10 01:12:13,806 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 1 predicate places. [2025-01-10 01:12:13,806 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 60 transitions, 186 flow [2025-01-10 01:12:13,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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) [2025-01-10 01:12:13,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:13,807 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:13,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:12:13,807 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:12:13,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:13,807 INFO L85 PathProgramCache]: Analyzing trace with hash -182469381, now seen corresponding path program 1 times [2025-01-10 01:12:13,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:13,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272200172] [2025-01-10 01:12:13,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:13,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:13,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:12:13,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:12:13,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:13,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:13,906 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:12:13,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:13,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272200172] [2025-01-10 01:12:13,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272200172] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:13,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:13,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:12:13,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513737799] [2025-01-10 01:12:13,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:13,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:12:13,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:13,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:12:13,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:12:13,917 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-01-10 01:12:13,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 60 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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) [2025-01-10 01:12:13,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:13,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-01-10 01:12:13,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:14,174 INFO L124 PetriNetUnfolderBase]: 2363/3822 cut-off events. [2025-01-10 01:12:14,175 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2025-01-10 01:12:14,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7884 conditions, 3822 events. 2363/3822 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 21662 event pairs, 2053 based on Foata normal form. 0/2684 useless extension candidates. Maximal degree in co-relation 7357. Up to 3231 conditions per place. [2025-01-10 01:12:14,185 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 42 selfloop transitions, 7 changer transitions 0/57 dead transitions. [2025-01-10 01:12:14,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 57 transitions, 272 flow [2025-01-10 01:12:14,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:12:14,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:12:14,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-01-10 01:12:14,186 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2025-01-10 01:12:14,186 INFO L175 Difference]: Start difference. First operand has 60 places, 60 transitions, 186 flow. Second operand 5 states and 110 transitions. [2025-01-10 01:12:14,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 57 transitions, 272 flow [2025-01-10 01:12:14,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 57 transitions, 267 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:12:14,187 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 183 flow [2025-01-10 01:12:14,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2025-01-10 01:12:14,187 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 0 predicate places. [2025-01-10 01:12:14,187 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 183 flow [2025-01-10 01:12:14,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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) [2025-01-10 01:12:14,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:14,187 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:14,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:12:14,188 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:12:14,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:14,188 INFO L85 PathProgramCache]: Analyzing trace with hash -182469380, now seen corresponding path program 1 times [2025-01-10 01:12:14,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:14,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862199838] [2025-01-10 01:12:14,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:14,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:14,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:12:14,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:12:14,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:14,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:14,321 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:12:14,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:14,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862199838] [2025-01-10 01:12:14,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862199838] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:14,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:14,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:12:14,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011556709] [2025-01-10 01:12:14,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:14,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:12:14,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:14,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:12:14,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:12:14,339 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-01-10 01:12:14,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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) [2025-01-10 01:12:14,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:14,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-01-10 01:12:14,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:14,466 INFO L124 PetriNetUnfolderBase]: 1616/2645 cut-off events. [2025-01-10 01:12:14,466 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-01-10 01:12:14,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5280 conditions, 2645 events. 1616/2645 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 13831 event pairs, 1376 based on Foata normal form. 0/2076 useless extension candidates. Maximal degree in co-relation 4700. Up to 2237 conditions per place. [2025-01-10 01:12:14,474 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 42 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2025-01-10 01:12:14,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 54 transitions, 263 flow [2025-01-10 01:12:14,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:12:14,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:12:14,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-01-10 01:12:14,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3875 [2025-01-10 01:12:14,476 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 183 flow. Second operand 4 states and 93 transitions. [2025-01-10 01:12:14,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 54 transitions, 263 flow [2025-01-10 01:12:14,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 252 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:12:14,477 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 168 flow [2025-01-10 01:12:14,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2025-01-10 01:12:14,477 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2025-01-10 01:12:14,478 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 168 flow [2025-01-10 01:12:14,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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) [2025-01-10 01:12:14,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:14,478 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:14,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:12:14,478 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:12:14,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:14,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2115289883, now seen corresponding path program 1 times [2025-01-10 01:12:14,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:14,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881302087] [2025-01-10 01:12:14,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:14,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:14,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:12:14,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:12:14,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:14,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:14,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:12:14,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:14,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881302087] [2025-01-10 01:12:14,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881302087] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:14,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:14,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:12:14,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433198962] [2025-01-10 01:12:14,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:14,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:12:14,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:14,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:12:14,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:12:14,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-01-10 01:12:14,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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) [2025-01-10 01:12:14,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:14,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-01-10 01:12:14,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:14,650 INFO L124 PetriNetUnfolderBase]: 1502/2421 cut-off events. [2025-01-10 01:12:14,650 INFO L125 PetriNetUnfolderBase]: For 336/336 co-relation queries the response was YES. [2025-01-10 01:12:14,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5057 conditions, 2421 events. 1502/2421 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12096 event pairs, 577 based on Foata normal form. 77/1921 useless extension candidates. Maximal degree in co-relation 4799. Up to 1517 conditions per place. [2025-01-10 01:12:14,661 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 58 selfloop transitions, 2 changer transitions 1/69 dead transitions. [2025-01-10 01:12:14,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 69 transitions, 328 flow [2025-01-10 01:12:14,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:12:14,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:12:14,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2025-01-10 01:12:14,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-01-10 01:12:14,662 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 168 flow. Second operand 3 states and 100 transitions. [2025-01-10 01:12:14,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 69 transitions, 328 flow [2025-01-10 01:12:14,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 69 transitions, 323 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:12:14,663 INFO L231 Difference]: Finished difference. Result has 57 places, 54 transitions, 174 flow [2025-01-10 01:12:14,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=57, PETRI_TRANSITIONS=54} [2025-01-10 01:12:14,664 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -2 predicate places. [2025-01-10 01:12:14,664 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 54 transitions, 174 flow [2025-01-10 01:12:14,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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) [2025-01-10 01:12:14,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:14,664 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:14,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:12:14,664 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:12:14,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:14,664 INFO L85 PathProgramCache]: Analyzing trace with hash 733256476, now seen corresponding path program 1 times [2025-01-10 01:12:14,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:14,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513277777] [2025-01-10 01:12:14,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:14,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:14,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:12:14,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:12:14,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:14,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:14,706 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:12:14,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:14,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513277777] [2025-01-10 01:12:14,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513277777] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:14,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:14,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:12:14,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032784114] [2025-01-10 01:12:14,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:14,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:12:14,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:14,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:12:14,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:12:14,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-01-10 01:12:14,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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) [2025-01-10 01:12:14,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:14,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-01-10 01:12:14,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:14,827 INFO L124 PetriNetUnfolderBase]: 1320/2150 cut-off events. [2025-01-10 01:12:14,827 INFO L125 PetriNetUnfolderBase]: For 403/403 co-relation queries the response was YES. [2025-01-10 01:12:14,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4770 conditions, 2150 events. 1320/2150 cut-off events. For 403/403 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 10345 event pairs, 527 based on Foata normal form. 18/1792 useless extension candidates. Maximal degree in co-relation 4735. Up to 1772 conditions per place. [2025-01-10 01:12:14,834 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 53 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2025-01-10 01:12:14,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 64 transitions, 312 flow [2025-01-10 01:12:14,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:12:14,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:12:14,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-01-10 01:12:14,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2025-01-10 01:12:14,835 INFO L175 Difference]: Start difference. First operand has 57 places, 54 transitions, 174 flow. Second operand 3 states and 93 transitions. [2025-01-10 01:12:14,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 64 transitions, 312 flow [2025-01-10 01:12:14,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 64 transitions, 310 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:12:14,836 INFO L231 Difference]: Finished difference. Result has 58 places, 56 transitions, 195 flow [2025-01-10 01:12:14,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=195, PETRI_PLACES=58, PETRI_TRANSITIONS=56} [2025-01-10 01:12:14,837 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -1 predicate places. [2025-01-10 01:12:14,837 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 56 transitions, 195 flow [2025-01-10 01:12:14,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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) [2025-01-10 01:12:14,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:14,837 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:14,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:12:14,837 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:12:14,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:14,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1643538565, now seen corresponding path program 1 times [2025-01-10 01:12:14,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:14,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513243463] [2025-01-10 01:12:14,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:14,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:14,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:12:14,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:12:14,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:14,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:12:14,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:14,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513243463] [2025-01-10 01:12:14,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513243463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:14,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:14,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:12:14,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666110177] [2025-01-10 01:12:14,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:14,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:12:14,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:14,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:12:14,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:12:14,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-01-10 01:12:14,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 195 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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) [2025-01-10 01:12:14,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:14,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-01-10 01:12:14,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:14,989 INFO L124 PetriNetUnfolderBase]: 966/1615 cut-off events. [2025-01-10 01:12:14,989 INFO L125 PetriNetUnfolderBase]: For 796/796 co-relation queries the response was YES. [2025-01-10 01:12:14,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3844 conditions, 1615 events. 966/1615 cut-off events. For 796/796 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7500 event pairs, 704 based on Foata normal form. 0/1445 useless extension candidates. Maximal degree in co-relation 3807. Up to 1367 conditions per place. [2025-01-10 01:12:14,995 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 42 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2025-01-10 01:12:14,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 54 transitions, 281 flow [2025-01-10 01:12:14,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:12:14,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:12:14,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2025-01-10 01:12:14,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-01-10 01:12:14,996 INFO L175 Difference]: Start difference. First operand has 58 places, 56 transitions, 195 flow. Second operand 4 states and 90 transitions. [2025-01-10 01:12:14,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 54 transitions, 281 flow [2025-01-10 01:12:14,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 54 transitions, 268 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-01-10 01:12:14,997 INFO L231 Difference]: Finished difference. Result has 57 places, 54 transitions, 184 flow [2025-01-10 01:12:14,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=57, PETRI_TRANSITIONS=54} [2025-01-10 01:12:14,998 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -2 predicate places. [2025-01-10 01:12:14,998 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 54 transitions, 184 flow [2025-01-10 01:12:14,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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) [2025-01-10 01:12:14,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:14,998 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:14,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:12:14,998 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:12:14,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:14,999 INFO L85 PathProgramCache]: Analyzing trace with hash 722823686, now seen corresponding path program 1 times [2025-01-10 01:12:14,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:14,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314425075] [2025-01-10 01:12:14,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:14,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:15,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:12:15,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:12:15,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:15,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:15,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:12:15,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:15,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314425075] [2025-01-10 01:12:15,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314425075] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:15,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:15,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:12:15,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479180425] [2025-01-10 01:12:15,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:15,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:12:15,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:15,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:12:15,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:12:15,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-01-10 01:12:15,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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) [2025-01-10 01:12:15,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:15,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-01-10 01:12:15,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:15,182 INFO L124 PetriNetUnfolderBase]: 1207/2013 cut-off events. [2025-01-10 01:12:15,182 INFO L125 PetriNetUnfolderBase]: For 396/396 co-relation queries the response was YES. [2025-01-10 01:12:15,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4464 conditions, 2013 events. 1207/2013 cut-off events. For 396/396 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 9503 event pairs, 906 based on Foata normal form. 64/1910 useless extension candidates. Maximal degree in co-relation 4427. Up to 1379 conditions per place. [2025-01-10 01:12:15,188 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 42 selfloop transitions, 3 changer transitions 19/72 dead transitions. [2025-01-10 01:12:15,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 72 transitions, 362 flow [2025-01-10 01:12:15,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:12:15,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:12:15,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-01-10 01:12:15,189 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4875 [2025-01-10 01:12:15,189 INFO L175 Difference]: Start difference. First operand has 57 places, 54 transitions, 184 flow. Second operand 4 states and 117 transitions. [2025-01-10 01:12:15,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 72 transitions, 362 flow [2025-01-10 01:12:15,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 72 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:12:15,190 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 183 flow [2025-01-10 01:12:15,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2025-01-10 01:12:15,191 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 0 predicate places. [2025-01-10 01:12:15,191 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 183 flow [2025-01-10 01:12:15,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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) [2025-01-10 01:12:15,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:15,191 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:15,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:12:15,191 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:12:15,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:15,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1558813914, now seen corresponding path program 1 times [2025-01-10 01:12:15,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:15,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164213666] [2025-01-10 01:12:15,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:15,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:15,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:12:15,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:12:15,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:15,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:15,373 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:12:15,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:15,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164213666] [2025-01-10 01:12:15,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164213666] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:15,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892492914] [2025-01-10 01:12:15,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:15,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:15,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:15,377 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:12:15,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:12:15,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:12:15,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:12:15,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:15,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:15,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:12:15,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:15,515 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:12:15,515 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:12:15,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892492914] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:15,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:12:15,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-01-10 01:12:15,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72362284] [2025-01-10 01:12:15,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:15,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:12:15,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:15,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:12:15,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:12:15,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-01-10 01:12:15,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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) [2025-01-10 01:12:15,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:15,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-01-10 01:12:15,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:15,649 INFO L124 PetriNetUnfolderBase]: 665/1161 cut-off events. [2025-01-10 01:12:15,649 INFO L125 PetriNetUnfolderBase]: For 293/293 co-relation queries the response was YES. [2025-01-10 01:12:15,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2567 conditions, 1161 events. 665/1161 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5233 event pairs, 474 based on Foata normal form. 86/1156 useless extension candidates. Maximal degree in co-relation 2528. Up to 946 conditions per place. [2025-01-10 01:12:15,654 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 39 selfloop transitions, 4 changer transitions 0/51 dead transitions. [2025-01-10 01:12:15,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 51 transitions, 261 flow [2025-01-10 01:12:15,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:12:15,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:12:15,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-01-10 01:12:15,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-01-10 01:12:15,655 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 183 flow. Second operand 4 states and 96 transitions. [2025-01-10 01:12:15,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 51 transitions, 261 flow [2025-01-10 01:12:15,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 51 transitions, 256 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 01:12:15,656 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 178 flow [2025-01-10 01:12:15,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2025-01-10 01:12:15,657 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -2 predicate places. [2025-01-10 01:12:15,657 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 178 flow [2025-01-10 01:12:15,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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) [2025-01-10 01:12:15,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:15,658 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] [2025-01-10 01:12:15,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:12:15,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:15,859 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:12:15,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:15,859 INFO L85 PathProgramCache]: Analyzing trace with hash 864965498, now seen corresponding path program 1 times [2025-01-10 01:12:15,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:15,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321825321] [2025-01-10 01:12:15,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:15,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:15,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:12:15,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:12:15,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:15,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:16,023 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:12:16,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:16,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321825321] [2025-01-10 01:12:16,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321825321] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:16,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:16,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:12:16,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135840197] [2025-01-10 01:12:16,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:16,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:12:16,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:16,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:12:16,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:12:16,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-01-10 01:12:16,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 178 flow. Second operand has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 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) [2025-01-10 01:12:16,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:16,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-01-10 01:12:16,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:16,214 INFO L124 PetriNetUnfolderBase]: 1276/2034 cut-off events. [2025-01-10 01:12:16,215 INFO L125 PetriNetUnfolderBase]: For 516/516 co-relation queries the response was YES. [2025-01-10 01:12:16,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4674 conditions, 2034 events. 1276/2034 cut-off events. For 516/516 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10393 event pairs, 342 based on Foata normal form. 1/1996 useless extension candidates. Maximal degree in co-relation 4634. Up to 776 conditions per place. [2025-01-10 01:12:16,220 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 87 selfloop transitions, 10 changer transitions 10/113 dead transitions. [2025-01-10 01:12:16,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 113 transitions, 565 flow [2025-01-10 01:12:16,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:12:16,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:12:16,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2025-01-10 01:12:16,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43125 [2025-01-10 01:12:16,221 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 178 flow. Second operand 8 states and 207 transitions. [2025-01-10 01:12:16,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 113 transitions, 565 flow [2025-01-10 01:12:16,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 113 transitions, 559 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:12:16,222 INFO L231 Difference]: Finished difference. Result has 65 places, 57 transitions, 224 flow [2025-01-10 01:12:16,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=224, PETRI_PLACES=65, PETRI_TRANSITIONS=57} [2025-01-10 01:12:16,223 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 6 predicate places. [2025-01-10 01:12:16,223 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 224 flow [2025-01-10 01:12:16,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 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) [2025-01-10 01:12:16,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:16,223 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] [2025-01-10 01:12:16,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:12:16,223 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:12:16,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:16,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1005085564, now seen corresponding path program 1 times [2025-01-10 01:12:16,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:16,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510784571] [2025-01-10 01:12:16,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:16,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:16,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 01:12:16,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 01:12:16,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:16,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:16,341 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:12:16,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:16,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510784571] [2025-01-10 01:12:16,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510784571] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:16,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642192901] [2025-01-10 01:12:16,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:16,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:16,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:16,344 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:12:16,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:12:16,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 01:12:16,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 01:12:16,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:16,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:16,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:12:16,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:16,487 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:12:16,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:16,561 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:12:16,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642192901] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:12:16,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:12:16,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2025-01-10 01:12:16,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163458750] [2025-01-10 01:12:16,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:12:16,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:12:16,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:16,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:12:16,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:12:16,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-01-10 01:12:16,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 224 flow. Second operand has 14 states, 14 states have (on average 20.571428571428573) internal successors, (288), 14 states have internal predecessors, (288), 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) [2025-01-10 01:12:16,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:16,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-01-10 01:12:16,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:16,986 INFO L124 PetriNetUnfolderBase]: 1663/3055 cut-off events. [2025-01-10 01:12:16,986 INFO L125 PetriNetUnfolderBase]: For 1370/1370 co-relation queries the response was YES. [2025-01-10 01:12:16,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7445 conditions, 3055 events. 1663/3055 cut-off events. For 1370/1370 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 18688 event pairs, 909 based on Foata normal form. 112/3016 useless extension candidates. Maximal degree in co-relation 7429. Up to 1490 conditions per place. [2025-01-10 01:12:16,993 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 77 selfloop transitions, 14 changer transitions 6/108 dead transitions. [2025-01-10 01:12:16,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 108 transitions, 598 flow [2025-01-10 01:12:16,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:12:16,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:12:16,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2025-01-10 01:12:16,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-01-10 01:12:16,994 INFO L175 Difference]: Start difference. First operand has 65 places, 57 transitions, 224 flow. Second operand 8 states and 210 transitions. [2025-01-10 01:12:16,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 108 transitions, 598 flow [2025-01-10 01:12:16,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 108 transitions, 589 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 01:12:16,996 INFO L231 Difference]: Finished difference. Result has 74 places, 65 transitions, 329 flow [2025-01-10 01:12:16,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=329, PETRI_PLACES=74, PETRI_TRANSITIONS=65} [2025-01-10 01:12:16,997 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 15 predicate places. [2025-01-10 01:12:16,997 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 329 flow [2025-01-10 01:12:16,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.571428571428573) internal successors, (288), 14 states have internal predecessors, (288), 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) [2025-01-10 01:12:16,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:16,997 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:17,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 01:12:17,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 01:12:17,201 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:12:17,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:17,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1295346088, now seen corresponding path program 1 times [2025-01-10 01:12:17,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:17,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952762194] [2025-01-10 01:12:17,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:17,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:17,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 01:12:17,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 01:12:17,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:17,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:17,273 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:12:17,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:17,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952762194] [2025-01-10 01:12:17,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952762194] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:17,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:17,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:12:17,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797323358] [2025-01-10 01:12:17,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:17,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:12:17,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:17,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:12:17,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:12:17,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-01-10 01:12:17,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 65 transitions, 329 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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) [2025-01-10 01:12:17,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:17,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-01-10 01:12:17,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:17,602 INFO L124 PetriNetUnfolderBase]: 2549/4812 cut-off events. [2025-01-10 01:12:17,602 INFO L125 PetriNetUnfolderBase]: For 4076/4234 co-relation queries the response was YES. [2025-01-10 01:12:17,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12287 conditions, 4812 events. 2549/4812 cut-off events. For 4076/4234 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 32173 event pairs, 732 based on Foata normal form. 132/4691 useless extension candidates. Maximal degree in co-relation 9529. Up to 1376 conditions per place. [2025-01-10 01:12:17,623 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 86 selfloop transitions, 6 changer transitions 0/103 dead transitions. [2025-01-10 01:12:17,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 103 transitions, 656 flow [2025-01-10 01:12:17,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:12:17,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:12:17,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2025-01-10 01:12:17,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-01-10 01:12:17,629 INFO L175 Difference]: Start difference. First operand has 74 places, 65 transitions, 329 flow. Second operand 4 states and 130 transitions. [2025-01-10 01:12:17,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 103 transitions, 656 flow [2025-01-10 01:12:17,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 103 transitions, 639 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-01-10 01:12:17,634 INFO L231 Difference]: Finished difference. Result has 77 places, 69 transitions, 373 flow [2025-01-10 01:12:17,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=373, PETRI_PLACES=77, PETRI_TRANSITIONS=69} [2025-01-10 01:12:17,635 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 18 predicate places. [2025-01-10 01:12:17,635 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 69 transitions, 373 flow [2025-01-10 01:12:17,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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) [2025-01-10 01:12:17,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:17,635 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:17,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:12:17,635 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:12:17,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:17,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1506453196, now seen corresponding path program 2 times [2025-01-10 01:12:17,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:17,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376793616] [2025-01-10 01:12:17,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:12:17,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:17,647 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-01-10 01:12:17,664 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 01:12:17,664 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:12:17,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:18,131 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:12:18,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:18,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376793616] [2025-01-10 01:12:18,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376793616] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:18,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074863733] [2025-01-10 01:12:18,131 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:12:18,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:18,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:18,138 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:12:18,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:12:18,184 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-01-10 01:12:18,209 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 01:12:18,209 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:12:18,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:18,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:12:18,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:12:18,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:18,547 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 01:12:18,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2025-01-10 01:12:18,706 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:12:18,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074863733] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:12:18,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:12:18,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2025-01-10 01:12:18,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980326773] [2025-01-10 01:12:18,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:12:18,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 01:12:18,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:18,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 01:12:18,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2025-01-10 01:12:18,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-01-10 01:12:18,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 69 transitions, 373 flow. Second operand has 23 states, 23 states have (on average 17.652173913043477) internal successors, (406), 23 states have internal predecessors, (406), 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) [2025-01-10 01:12:18,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:18,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-01-10 01:12:18,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:20,977 INFO L124 PetriNetUnfolderBase]: 11150/18158 cut-off events. [2025-01-10 01:12:20,977 INFO L125 PetriNetUnfolderBase]: For 25011/25968 co-relation queries the response was YES. [2025-01-10 01:12:21,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52725 conditions, 18158 events. 11150/18158 cut-off events. For 25011/25968 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 128945 event pairs, 1554 based on Foata normal form. 109/17508 useless extension candidates. Maximal degree in co-relation 35390. Up to 3624 conditions per place. [2025-01-10 01:12:21,085 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 275 selfloop transitions, 56 changer transitions 0/340 dead transitions. [2025-01-10 01:12:21,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 340 transitions, 2223 flow [2025-01-10 01:12:21,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 01:12:21,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-01-10 01:12:21,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 621 transitions. [2025-01-10 01:12:21,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43125 [2025-01-10 01:12:21,087 INFO L175 Difference]: Start difference. First operand has 77 places, 69 transitions, 373 flow. Second operand 24 states and 621 transitions. [2025-01-10 01:12:21,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 340 transitions, 2223 flow [2025-01-10 01:12:21,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 340 transitions, 2181 flow, removed 21 selfloop flow, removed 0 redundant places. [2025-01-10 01:12:21,100 INFO L231 Difference]: Finished difference. Result has 112 places, 126 transitions, 966 flow [2025-01-10 01:12:21,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=966, PETRI_PLACES=112, PETRI_TRANSITIONS=126} [2025-01-10 01:12:21,100 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 53 predicate places. [2025-01-10 01:12:21,100 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 126 transitions, 966 flow [2025-01-10 01:12:21,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 17.652173913043477) internal successors, (406), 23 states have internal predecessors, (406), 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) [2025-01-10 01:12:21,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:21,100 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:21,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 01:12:21,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 01:12:21,301 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:12:21,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:21,302 INFO L85 PathProgramCache]: Analyzing trace with hash 180545070, now seen corresponding path program 3 times [2025-01-10 01:12:21,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:21,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190805429] [2025-01-10 01:12:21,302 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:12:21,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:21,312 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 5 equivalence classes. [2025-01-10 01:12:21,336 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 35 of 40 statements. [2025-01-10 01:12:21,336 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:12:21,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:21,498 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:12:21,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:21,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190805429] [2025-01-10 01:12:21,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190805429] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:21,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:21,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:12:21,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293146762] [2025-01-10 01:12:21,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:21,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:12:21,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:21,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:12:21,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:12:21,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-01-10 01:12:21,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 126 transitions, 966 flow. Second operand has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 states have internal predecessors, (143), 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) [2025-01-10 01:12:21,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:21,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-01-10 01:12:21,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:22,950 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([736] L87-1-->L92: Formula: (let ((.cse0 (* 4 v_~q2_front~0_84))) (let ((.cse1 (+ v_~q2~0.offset_71 .cse0))) (and (<= (+ v_~q2~0.offset_71 .cse0 4) (select |v_#length_163| v_~q2~0.base_75)) (not (= (ite (and (< v_~q2_front~0_84 v_~n2~0_94) (<= 0 v_~q2_front~0_84) (< v_~q2_front~0_84 v_~q2_back~0_89)) 1 0) 0)) (= (select |v_#valid_174| v_~q2~0.base_75) 1) (= v_~q2_front~0_83 (+ v_~q2_front~0_84 1)) (= (select (select |v_#memory_int#1_54| v_~q2~0.base_75) .cse1) |v_thread3Thread1of1ForFork1_~k~0#1_3|) (<= 0 .cse1)))) InVars {~n2~0=v_~n2~0_94, ~q2~0.offset=v_~q2~0.offset_71, #valid=|v_#valid_174|, ~q2_front~0=v_~q2_front~0_84, ~q2~0.base=v_~q2~0.base_75, #length=|v_#length_163|, #memory_int#1=|v_#memory_int#1_54|, ~q2_back~0=v_~q2_back~0_89} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread3Thread1of1ForFork1_#t~mem10#1=|v_thread3Thread1of1ForFork1_#t~mem10#1_1|, ~n2~0=v_~n2~0_94, ~q2~0.offset=v_~q2~0.offset_71, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, ~q2_front~0=v_~q2_front~0_83, #memory_int#1=|v_#memory_int#1_54|, #valid=|v_#valid_174|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, ~q2~0.base=v_~q2~0.base_75, #length=|v_#length_163|, thread3Thread1of1ForFork1_~k~0#1=|v_thread3Thread1of1ForFork1_~k~0#1_3|, ~q2_back~0=v_~q2_back~0_89} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~mem10#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~post11#1, ~q2_front~0, thread3Thread1of1ForFork1_~k~0#1][93], [Black: 495#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n1~0 2)), 30#L120-4true, Black: 508#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 32#L70true, Black: 519#(<= ~q2_back~0 (+ 1 ~q2_front~0)), 243#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 190#(= (select |#valid| ~q1~0.base) 1), Black: 200#(<= ~q2_back~0 ~q2_front~0), Black: 204#(<= ~q1_back~0 ~q1_front~0), 209#(= (select |#valid| ~q2~0.base) 1), Black: 274#(and (or (< ~N~0 (+ ~t~0 1)) (< (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1|) (+ ~t~0 1))) (or (< ~t~0 (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1| 1)) (< ~t~0 (+ ~N~0 1)))), 813#true, Black: 272#(and (<= 0 ~N~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~t~0 0)), 21#L92true, 7#L52true, Black: 790#(and (= ~q1~0.offset 0) (or (and (<= ~q1_front~0 0) (or (not (= ~q1_front~0 0)) (not (= (select (select |#memory_int#1| ~q1~0.base) 0) 0)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 786#(and (or (not (= ~q1_back~0 0)) (and (or (< (+ ~q1_front~0 ~n1~0) 3) (< ~q1_front~0 1)) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_front~0 0))))) (= ~q1~0.offset 0) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_back~0 1) (< ~n1~0 3))), Black: 792#(and (<= ~q1_front~0 0) (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 794#(and (= ~q1~0.offset 0) (or (and (<= ~q1_front~0 0) (or (not (= ~q1_front~0 0)) (not (= (select (select |#memory_int#1| ~q1~0.base) 0) 0)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 776#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_back~0 0))) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 772#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= ~q1_back~0 ~q1_front~0) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_back~0 0))) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 613#(= |thread2Thread1of1ForFork0_~j~0#1| 1), Black: 780#(and (or (not (= ~q1_back~0 0)) (and (or (< (+ ~q1_front~0 ~n1~0) 3) (< ~q1_front~0 1)) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_front~0 0))))) (= ~q1~0.offset 0) (or (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_back~0 1) (< ~n1~0 3))), 522#true, Black: 774#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1_back~0 ~q1_front~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 531#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 798#(and (<= ~q1_front~0 0) (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), 197#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))), 268#true, 518#(<= ~q2_back~0 ~q2_front~0), 129#(<= ~n2~0 2147483647), 279#true, Black: 506#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)))]) [2025-01-10 01:12:22,950 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2025-01-10 01:12:22,950 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-01-10 01:12:22,950 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-01-10 01:12:22,950 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 01:12:22,950 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] L87-2-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][151], [Black: 495#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n1~0 2)), 30#L120-4true, Black: 508#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 32#L70true, 243#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 190#(= (select |#valid| ~q1~0.base) 1), Black: 518#(<= ~q2_back~0 ~q2_front~0), Black: 200#(<= ~q2_back~0 ~q2_front~0), Black: 204#(<= ~q1_back~0 ~q1_front~0), 209#(= (select |#valid| ~q2~0.base) 1), 813#true, Black: 274#(and (or (< ~N~0 (+ ~t~0 1)) (< (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1|) (+ ~t~0 1))) (or (< ~t~0 (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1| 1)) (< ~t~0 (+ ~N~0 1)))), Black: 272#(and (<= 0 ~N~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~t~0 0)), 7#L52true, 22#thread3EXITtrue, Black: 790#(and (= ~q1~0.offset 0) (or (and (<= ~q1_front~0 0) (or (not (= ~q1_front~0 0)) (not (= (select (select |#memory_int#1| ~q1~0.base) 0) 0)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 786#(and (or (not (= ~q1_back~0 0)) (and (or (< (+ ~q1_front~0 ~n1~0) 3) (< ~q1_front~0 1)) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_front~0 0))))) (= ~q1~0.offset 0) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_back~0 1) (< ~n1~0 3))), Black: 792#(and (<= ~q1_front~0 0) (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 794#(and (= ~q1~0.offset 0) (or (and (<= ~q1_front~0 0) (or (not (= ~q1_front~0 0)) (not (= (select (select |#memory_int#1| ~q1~0.base) 0) 0)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 776#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_back~0 0))) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 772#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= ~q1_back~0 ~q1_front~0) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_back~0 0))) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 613#(= |thread2Thread1of1ForFork0_~j~0#1| 1), Black: 780#(and (or (not (= ~q1_back~0 0)) (and (or (< (+ ~q1_front~0 ~n1~0) 3) (< ~q1_front~0 1)) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_front~0 0))))) (= ~q1~0.offset 0) (or (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_back~0 1) (< ~n1~0 3))), 522#true, Black: 774#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1_back~0 ~q1_front~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 531#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 798#(and (<= ~q1_front~0 0) (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), 197#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))), 519#(<= ~q2_back~0 (+ 1 ~q2_front~0)), 268#true, 129#(<= ~n2~0 2147483647), 279#true, Black: 506#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)))]) [2025-01-10 01:12:22,950 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2025-01-10 01:12:22,950 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-01-10 01:12:22,950 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-01-10 01:12:22,950 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 01:12:23,003 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([736] L87-1-->L92: Formula: (let ((.cse0 (* 4 v_~q2_front~0_84))) (let ((.cse1 (+ v_~q2~0.offset_71 .cse0))) (and (<= (+ v_~q2~0.offset_71 .cse0 4) (select |v_#length_163| v_~q2~0.base_75)) (not (= (ite (and (< v_~q2_front~0_84 v_~n2~0_94) (<= 0 v_~q2_front~0_84) (< v_~q2_front~0_84 v_~q2_back~0_89)) 1 0) 0)) (= (select |v_#valid_174| v_~q2~0.base_75) 1) (= v_~q2_front~0_83 (+ v_~q2_front~0_84 1)) (= (select (select |v_#memory_int#1_54| v_~q2~0.base_75) .cse1) |v_thread3Thread1of1ForFork1_~k~0#1_3|) (<= 0 .cse1)))) InVars {~n2~0=v_~n2~0_94, ~q2~0.offset=v_~q2~0.offset_71, #valid=|v_#valid_174|, ~q2_front~0=v_~q2_front~0_84, ~q2~0.base=v_~q2~0.base_75, #length=|v_#length_163|, #memory_int#1=|v_#memory_int#1_54|, ~q2_back~0=v_~q2_back~0_89} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread3Thread1of1ForFork1_#t~mem10#1=|v_thread3Thread1of1ForFork1_#t~mem10#1_1|, ~n2~0=v_~n2~0_94, ~q2~0.offset=v_~q2~0.offset_71, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, ~q2_front~0=v_~q2_front~0_83, #memory_int#1=|v_#memory_int#1_54|, #valid=|v_#valid_174|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, ~q2~0.base=v_~q2~0.base_75, #length=|v_#length_163|, thread3Thread1of1ForFork1_~k~0#1=|v_thread3Thread1of1ForFork1_~k~0#1_3|, ~q2_back~0=v_~q2_back~0_89} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~mem10#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~post11#1, ~q2_front~0, thread3Thread1of1ForFork1_~k~0#1][93], [Black: 495#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n1~0 2)), Black: 508#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 32#L70true, Black: 519#(<= ~q2_back~0 (+ 1 ~q2_front~0)), 243#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 190#(= (select |#valid| ~q1~0.base) 1), Black: 200#(<= ~q2_back~0 ~q2_front~0), Black: 204#(<= ~q1_back~0 ~q1_front~0), 209#(= (select |#valid| ~q2~0.base) 1), Black: 274#(and (or (< ~N~0 (+ ~t~0 1)) (< (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1|) (+ ~t~0 1))) (or (< ~t~0 (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1| 1)) (< ~t~0 (+ ~N~0 1)))), 813#true, Black: 272#(and (<= 0 ~N~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~t~0 0)), 7#L52true, 21#L92true, Black: 790#(and (= ~q1~0.offset 0) (or (and (<= ~q1_front~0 0) (or (not (= ~q1_front~0 0)) (not (= (select (select |#memory_int#1| ~q1~0.base) 0) 0)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 786#(and (or (not (= ~q1_back~0 0)) (and (or (< (+ ~q1_front~0 ~n1~0) 3) (< ~q1_front~0 1)) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_front~0 0))))) (= ~q1~0.offset 0) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_back~0 1) (< ~n1~0 3))), Black: 792#(and (<= ~q1_front~0 0) (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 794#(and (= ~q1~0.offset 0) (or (and (<= ~q1_front~0 0) (or (not (= ~q1_front~0 0)) (not (= (select (select |#memory_int#1| ~q1~0.base) 0) 0)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 776#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_back~0 0))) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 772#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= ~q1_back~0 ~q1_front~0) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_back~0 0))) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 613#(= |thread2Thread1of1ForFork0_~j~0#1| 1), Black: 780#(and (or (not (= ~q1_back~0 0)) (and (or (< (+ ~q1_front~0 ~n1~0) 3) (< ~q1_front~0 1)) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_front~0 0))))) (= ~q1~0.offset 0) (or (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_back~0 1) (< ~n1~0 3))), 522#true, Black: 774#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1_back~0 ~q1_front~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 531#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 798#(and (<= ~q1_front~0 0) (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), 197#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))), 27#L121true, 268#true, 518#(<= ~q2_back~0 ~q2_front~0), 129#(<= ~n2~0 2147483647), 279#true, Black: 506#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)))]) [2025-01-10 01:12:23,003 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2025-01-10 01:12:23,003 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-10 01:12:23,003 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-01-10 01:12:23,003 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-10 01:12:23,003 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] L87-2-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][151], [Black: 495#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n1~0 2)), Black: 508#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 32#L70true, 243#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 190#(= (select |#valid| ~q1~0.base) 1), Black: 518#(<= ~q2_back~0 ~q2_front~0), Black: 200#(<= ~q2_back~0 ~q2_front~0), Black: 204#(<= ~q1_back~0 ~q1_front~0), 209#(= (select |#valid| ~q2~0.base) 1), Black: 274#(and (or (< ~N~0 (+ ~t~0 1)) (< (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1|) (+ ~t~0 1))) (or (< ~t~0 (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1| 1)) (< ~t~0 (+ ~N~0 1)))), 813#true, Black: 272#(and (<= 0 ~N~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~t~0 0)), 7#L52true, 22#thread3EXITtrue, Black: 790#(and (= ~q1~0.offset 0) (or (and (<= ~q1_front~0 0) (or (not (= ~q1_front~0 0)) (not (= (select (select |#memory_int#1| ~q1~0.base) 0) 0)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 786#(and (or (not (= ~q1_back~0 0)) (and (or (< (+ ~q1_front~0 ~n1~0) 3) (< ~q1_front~0 1)) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_front~0 0))))) (= ~q1~0.offset 0) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_back~0 1) (< ~n1~0 3))), Black: 792#(and (<= ~q1_front~0 0) (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 794#(and (= ~q1~0.offset 0) (or (and (<= ~q1_front~0 0) (or (not (= ~q1_front~0 0)) (not (= (select (select |#memory_int#1| ~q1~0.base) 0) 0)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 776#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_back~0 0))) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 772#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= ~q1_back~0 ~q1_front~0) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_back~0 0))) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 613#(= |thread2Thread1of1ForFork0_~j~0#1| 1), Black: 780#(and (or (not (= ~q1_back~0 0)) (and (or (< (+ ~q1_front~0 ~n1~0) 3) (< ~q1_front~0 1)) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_front~0 0))))) (= ~q1~0.offset 0) (or (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_back~0 1) (< ~n1~0 3))), 522#true, Black: 774#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1_back~0 ~q1_front~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 531#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 798#(and (<= ~q1_front~0 0) (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), 197#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))), 27#L121true, 519#(<= ~q2_back~0 (+ 1 ~q2_front~0)), 268#true, 129#(<= ~n2~0 2147483647), 279#true, Black: 506#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)))]) [2025-01-10 01:12:23,003 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2025-01-10 01:12:23,003 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-10 01:12:23,003 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-01-10 01:12:23,003 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-10 01:12:23,126 INFO L124 PetriNetUnfolderBase]: 10845/17956 cut-off events. [2025-01-10 01:12:23,126 INFO L125 PetriNetUnfolderBase]: For 44908/45748 co-relation queries the response was YES. [2025-01-10 01:12:23,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60283 conditions, 17956 events. 10845/17956 cut-off events. For 44908/45748 co-relation queries the response was YES. Maximal size of possible extension queue 766. Compared 130033 event pairs, 2767 based on Foata normal form. 178/18021 useless extension candidates. Maximal degree in co-relation 41842. Up to 10477 conditions per place. [2025-01-10 01:12:23,245 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 127 selfloop transitions, 30 changer transitions 0/166 dead transitions. [2025-01-10 01:12:23,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 166 transitions, 1453 flow [2025-01-10 01:12:23,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:12:23,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:12:23,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions. [2025-01-10 01:12:23,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2025-01-10 01:12:23,249 INFO L175 Difference]: Start difference. First operand has 112 places, 126 transitions, 966 flow. Second operand 7 states and 170 transitions. [2025-01-10 01:12:23,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 166 transitions, 1453 flow [2025-01-10 01:12:23,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 166 transitions, 1246 flow, removed 95 selfloop flow, removed 4 redundant places. [2025-01-10 01:12:23,376 INFO L231 Difference]: Finished difference. Result has 116 places, 128 transitions, 891 flow [2025-01-10 01:12:23,376 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=891, PETRI_PLACES=116, PETRI_TRANSITIONS=128} [2025-01-10 01:12:23,376 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 57 predicate places. [2025-01-10 01:12:23,376 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 128 transitions, 891 flow [2025-01-10 01:12:23,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 states have internal predecessors, (143), 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) [2025-01-10 01:12:23,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:23,377 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:23,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 01:12:23,377 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:12:23,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:23,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1667468900, now seen corresponding path program 1 times [2025-01-10 01:12:23,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:23,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361407695] [2025-01-10 01:12:23,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:23,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:23,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 01:12:23,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 01:12:23,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:23,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:23,439 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:12:23,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:23,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361407695] [2025-01-10 01:12:23,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361407695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:23,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:23,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:12:23,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258402214] [2025-01-10 01:12:23,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:23,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:12:23,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:23,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:12:23,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:12:23,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-01-10 01:12:23,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 128 transitions, 891 flow. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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) [2025-01-10 01:12:23,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:23,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-01-10 01:12:23,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:24,681 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([724] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_front~0_96))) (let ((.cse0 (+ v_~q1~0.offset_91 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_96 v_~n1~0_95) (< v_~q1_front~0_96 v_~q1_back~0_134) (<= 0 v_~q1_front~0_96)) 1 0) 0)) (<= 0 .cse0) (= (select (select |v_#memory_int#1_56| v_~q1~0.base_96) .cse0) |v_thread2Thread1of1ForFork0_~j~0#1_3|) (= (+ v_~q1_front~0_96 1) v_~q1_front~0_95) (<= (+ v_~q1~0.offset_91 .cse1 4) (select |v_#length_167| v_~q1~0.base_96)) (= (select |v_#valid_178| v_~q1~0.base_96) 1)))) InVars {~q1~0.offset=v_~q1~0.offset_91, ~q1_front~0=v_~q1_front~0_96, ~q1_back~0=v_~q1_back~0_134, ~n1~0=v_~n1~0_95, ~q1~0.base=v_~q1~0.base_96, #valid=|v_#valid_178|, #length=|v_#length_167|, #memory_int#1=|v_#memory_int#1_56|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_91, ~q1_front~0=v_~q1_front~0_95, ~n1~0=v_~n1~0_95, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_56|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_134, ~q1~0.base=v_~q1~0.base_96, #valid=|v_#valid_178|, #length=|v_#length_167|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][143], [Black: 495#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n1~0 2)), 30#L120-4true, Black: 508#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 32#L70true, 243#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 190#(= (select |#valid| ~q1~0.base) 1), Black: 519#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 200#(<= ~q2_back~0 ~q2_front~0), 209#(= (select |#valid| ~q2~0.base) 1), 813#true, Black: 274#(and (or (< ~N~0 (+ ~t~0 1)) (< (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1|) (+ ~t~0 1))) (or (< ~t~0 (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1| 1)) (< ~t~0 (+ ~N~0 1)))), Black: 272#(and (<= 0 ~N~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~t~0 0)), 22#thread3EXITtrue, Black: 790#(and (= ~q1~0.offset 0) (or (and (<= ~q1_front~0 0) (or (not (= ~q1_front~0 0)) (not (= (select (select |#memory_int#1| ~q1~0.base) 0) 0)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 786#(and (or (not (= ~q1_back~0 0)) (and (or (< (+ ~q1_front~0 ~n1~0) 3) (< ~q1_front~0 1)) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_front~0 0))))) (= ~q1~0.offset 0) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_back~0 1) (< ~n1~0 3))), Black: 792#(and (<= ~q1_front~0 0) (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 794#(and (= ~q1~0.offset 0) (or (and (<= ~q1_front~0 0) (or (not (= ~q1_front~0 0)) (not (= (select (select |#memory_int#1| ~q1~0.base) 0) 0)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 776#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_back~0 0))) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 772#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= ~q1_back~0 ~q1_front~0) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_back~0 0))) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 613#(= |thread2Thread1of1ForFork0_~j~0#1| 1), Black: 780#(and (or (not (= ~q1_back~0 0)) (and (or (< (+ ~q1_front~0 ~n1~0) 3) (< ~q1_front~0 1)) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_front~0 0))))) (= ~q1~0.offset 0) (or (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_back~0 1) (< ~n1~0 3))), 522#true, Black: 774#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1_back~0 ~q1_front~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 531#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 798#(and (<= ~q1_front~0 0) (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), 197#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))), 268#true, Black: 820#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 518#(<= ~q2_back~0 ~q2_front~0), 11#thread1EXITtrue, 129#(<= ~n2~0 2147483647), 279#true, 825#true, Black: 506#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)))]) [2025-01-10 01:12:24,682 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2025-01-10 01:12:24,682 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 01:12:24,682 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:12:24,682 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2025-01-10 01:12:24,718 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([724] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_front~0_96))) (let ((.cse0 (+ v_~q1~0.offset_91 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_96 v_~n1~0_95) (< v_~q1_front~0_96 v_~q1_back~0_134) (<= 0 v_~q1_front~0_96)) 1 0) 0)) (<= 0 .cse0) (= (select (select |v_#memory_int#1_56| v_~q1~0.base_96) .cse0) |v_thread2Thread1of1ForFork0_~j~0#1_3|) (= (+ v_~q1_front~0_96 1) v_~q1_front~0_95) (<= (+ v_~q1~0.offset_91 .cse1 4) (select |v_#length_167| v_~q1~0.base_96)) (= (select |v_#valid_178| v_~q1~0.base_96) 1)))) InVars {~q1~0.offset=v_~q1~0.offset_91, ~q1_front~0=v_~q1_front~0_96, ~q1_back~0=v_~q1_back~0_134, ~n1~0=v_~n1~0_95, ~q1~0.base=v_~q1~0.base_96, #valid=|v_#valid_178|, #length=|v_#length_167|, #memory_int#1=|v_#memory_int#1_56|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_91, ~q1_front~0=v_~q1_front~0_95, ~n1~0=v_~n1~0_95, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_56|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_134, ~q1~0.base=v_~q1~0.base_96, #valid=|v_#valid_178|, #length=|v_#length_167|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][143], [Black: 495#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n1~0 2)), Black: 508#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 32#L70true, 243#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 190#(= (select |#valid| ~q1~0.base) 1), Black: 519#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 200#(<= ~q2_back~0 ~q2_front~0), 209#(= (select |#valid| ~q2~0.base) 1), Black: 274#(and (or (< ~N~0 (+ ~t~0 1)) (< (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1|) (+ ~t~0 1))) (or (< ~t~0 (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1| 1)) (< ~t~0 (+ ~N~0 1)))), 813#true, Black: 272#(and (<= 0 ~N~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~t~0 0)), 22#thread3EXITtrue, Black: 790#(and (= ~q1~0.offset 0) (or (and (<= ~q1_front~0 0) (or (not (= ~q1_front~0 0)) (not (= (select (select |#memory_int#1| ~q1~0.base) 0) 0)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 786#(and (or (not (= ~q1_back~0 0)) (and (or (< (+ ~q1_front~0 ~n1~0) 3) (< ~q1_front~0 1)) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_front~0 0))))) (= ~q1~0.offset 0) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_back~0 1) (< ~n1~0 3))), Black: 792#(and (<= ~q1_front~0 0) (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 794#(and (= ~q1~0.offset 0) (or (and (<= ~q1_front~0 0) (or (not (= ~q1_front~0 0)) (not (= (select (select |#memory_int#1| ~q1~0.base) 0) 0)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 776#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_back~0 0))) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 772#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= ~q1_back~0 ~q1_front~0) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_back~0 0))) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 613#(= |thread2Thread1of1ForFork0_~j~0#1| 1), Black: 780#(and (or (not (= ~q1_back~0 0)) (and (or (< (+ ~q1_front~0 ~n1~0) 3) (< ~q1_front~0 1)) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_front~0 0))))) (= ~q1~0.offset 0) (or (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_back~0 1) (< ~n1~0 3))), 522#true, Black: 774#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1_back~0 ~q1_front~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 531#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 798#(and (<= ~q1_front~0 0) (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), 197#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))), 27#L121true, 268#true, Black: 820#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 518#(<= ~q2_back~0 ~q2_front~0), 11#thread1EXITtrue, 129#(<= ~n2~0 2147483647), 279#true, 825#true, Black: 506#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)))]) [2025-01-10 01:12:24,719 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2025-01-10 01:12:24,719 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2025-01-10 01:12:24,719 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:12:24,719 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-01-10 01:12:24,751 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([724] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_front~0_96))) (let ((.cse0 (+ v_~q1~0.offset_91 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_96 v_~n1~0_95) (< v_~q1_front~0_96 v_~q1_back~0_134) (<= 0 v_~q1_front~0_96)) 1 0) 0)) (<= 0 .cse0) (= (select (select |v_#memory_int#1_56| v_~q1~0.base_96) .cse0) |v_thread2Thread1of1ForFork0_~j~0#1_3|) (= (+ v_~q1_front~0_96 1) v_~q1_front~0_95) (<= (+ v_~q1~0.offset_91 .cse1 4) (select |v_#length_167| v_~q1~0.base_96)) (= (select |v_#valid_178| v_~q1~0.base_96) 1)))) InVars {~q1~0.offset=v_~q1~0.offset_91, ~q1_front~0=v_~q1_front~0_96, ~q1_back~0=v_~q1_back~0_134, ~n1~0=v_~n1~0_95, ~q1~0.base=v_~q1~0.base_96, #valid=|v_#valid_178|, #length=|v_#length_167|, #memory_int#1=|v_#memory_int#1_56|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_91, ~q1_front~0=v_~q1_front~0_95, ~n1~0=v_~n1~0_95, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_56|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_134, ~q1~0.base=v_~q1~0.base_96, #valid=|v_#valid_178|, #length=|v_#length_167|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][143], [Black: 495#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n1~0 2)), Black: 508#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 32#L70true, 243#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 190#(= (select |#valid| ~q1~0.base) 1), Black: 519#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 200#(<= ~q2_back~0 ~q2_front~0), 209#(= (select |#valid| ~q2~0.base) 1), 813#true, Black: 274#(and (or (< ~N~0 (+ ~t~0 1)) (< (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1|) (+ ~t~0 1))) (or (< ~t~0 (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1| 1)) (< ~t~0 (+ ~N~0 1)))), Black: 272#(and (<= 0 ~N~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~t~0 0)), 22#thread3EXITtrue, Black: 790#(and (= ~q1~0.offset 0) (or (and (<= ~q1_front~0 0) (or (not (= ~q1_front~0 0)) (not (= (select (select |#memory_int#1| ~q1~0.base) 0) 0)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 786#(and (or (not (= ~q1_back~0 0)) (and (or (< (+ ~q1_front~0 ~n1~0) 3) (< ~q1_front~0 1)) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_front~0 0))))) (= ~q1~0.offset 0) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_back~0 1) (< ~n1~0 3))), Black: 792#(and (<= ~q1_front~0 0) (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 794#(and (= ~q1~0.offset 0) (or (and (<= ~q1_front~0 0) (or (not (= ~q1_front~0 0)) (not (= (select (select |#memory_int#1| ~q1~0.base) 0) 0)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 776#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_back~0 0))) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 772#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= ~q1_back~0 ~q1_front~0) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_back~0 0))) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 613#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 522#true, Black: 780#(and (or (not (= ~q1_back~0 0)) (and (or (< (+ ~q1_front~0 ~n1~0) 3) (< ~q1_front~0 1)) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_front~0 0))))) (= ~q1~0.offset 0) (or (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_back~0 1) (< ~n1~0 3))), Black: 774#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1_back~0 ~q1_front~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 531#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 798#(and (<= ~q1_front~0 0) (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), 197#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))), 34#L121-1true, 268#true, Black: 820#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 518#(<= ~q2_back~0 ~q2_front~0), 129#(<= ~n2~0 2147483647), 279#true, 825#true, Black: 506#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)))]) [2025-01-10 01:12:24,751 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2025-01-10 01:12:24,751 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2025-01-10 01:12:24,751 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-10 01:12:24,751 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-10 01:12:24,752 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([724] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_front~0_96))) (let ((.cse0 (+ v_~q1~0.offset_91 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_96 v_~n1~0_95) (< v_~q1_front~0_96 v_~q1_back~0_134) (<= 0 v_~q1_front~0_96)) 1 0) 0)) (<= 0 .cse0) (= (select (select |v_#memory_int#1_56| v_~q1~0.base_96) .cse0) |v_thread2Thread1of1ForFork0_~j~0#1_3|) (= (+ v_~q1_front~0_96 1) v_~q1_front~0_95) (<= (+ v_~q1~0.offset_91 .cse1 4) (select |v_#length_167| v_~q1~0.base_96)) (= (select |v_#valid_178| v_~q1~0.base_96) 1)))) InVars {~q1~0.offset=v_~q1~0.offset_91, ~q1_front~0=v_~q1_front~0_96, ~q1_back~0=v_~q1_back~0_134, ~n1~0=v_~n1~0_95, ~q1~0.base=v_~q1~0.base_96, #valid=|v_#valid_178|, #length=|v_#length_167|, #memory_int#1=|v_#memory_int#1_56|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_91, ~q1_front~0=v_~q1_front~0_95, ~n1~0=v_~n1~0_95, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_56|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_134, ~q1~0.base=v_~q1~0.base_96, #valid=|v_#valid_178|, #length=|v_#length_167|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][143], [Black: 495#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n1~0 2)), 30#L120-4true, Black: 508#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 32#L70true, 243#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 190#(= (select |#valid| ~q1~0.base) 1), Black: 519#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 200#(<= ~q2_back~0 ~q2_front~0), 209#(= (select |#valid| ~q2~0.base) 1), 813#true, Black: 274#(and (or (< ~N~0 (+ ~t~0 1)) (< (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1|) (+ ~t~0 1))) (or (< ~t~0 (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1| 1)) (< ~t~0 (+ ~N~0 1)))), Black: 272#(and (<= 0 ~N~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~t~0 0)), 22#thread3EXITtrue, Black: 790#(and (= ~q1~0.offset 0) (or (and (<= ~q1_front~0 0) (or (not (= ~q1_front~0 0)) (not (= (select (select |#memory_int#1| ~q1~0.base) 0) 0)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 786#(and (or (not (= ~q1_back~0 0)) (and (or (< (+ ~q1_front~0 ~n1~0) 3) (< ~q1_front~0 1)) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_front~0 0))))) (= ~q1~0.offset 0) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_back~0 1) (< ~n1~0 3))), Black: 792#(and (<= ~q1_front~0 0) (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 794#(and (= ~q1~0.offset 0) (or (and (<= ~q1_front~0 0) (or (not (= ~q1_front~0 0)) (not (= (select (select |#memory_int#1| ~q1~0.base) 0) 0)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 776#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_back~0 0))) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 772#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= ~q1_back~0 ~q1_front~0) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_back~0 0))) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 613#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 522#true, Black: 780#(and (or (not (= ~q1_back~0 0)) (and (or (< (+ ~q1_front~0 ~n1~0) 3) (< ~q1_front~0 1)) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_front~0 0))))) (= ~q1~0.offset 0) (or (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_back~0 1) (< ~n1~0 3))), 53#L47-4true, Black: 774#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1_back~0 ~q1_front~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 531#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 798#(and (<= ~q1_front~0 0) (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), 197#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))), 268#true, Black: 820#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 518#(<= ~q2_back~0 ~q2_front~0), 129#(<= ~n2~0 2147483647), 279#true, 825#true, Black: 506#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)))]) [2025-01-10 01:12:24,752 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2025-01-10 01:12:24,753 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:12:24,753 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 01:12:24,753 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2025-01-10 01:12:24,775 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([724] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_front~0_96))) (let ((.cse0 (+ v_~q1~0.offset_91 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_96 v_~n1~0_95) (< v_~q1_front~0_96 v_~q1_back~0_134) (<= 0 v_~q1_front~0_96)) 1 0) 0)) (<= 0 .cse0) (= (select (select |v_#memory_int#1_56| v_~q1~0.base_96) .cse0) |v_thread2Thread1of1ForFork0_~j~0#1_3|) (= (+ v_~q1_front~0_96 1) v_~q1_front~0_95) (<= (+ v_~q1~0.offset_91 .cse1 4) (select |v_#length_167| v_~q1~0.base_96)) (= (select |v_#valid_178| v_~q1~0.base_96) 1)))) InVars {~q1~0.offset=v_~q1~0.offset_91, ~q1_front~0=v_~q1_front~0_96, ~q1_back~0=v_~q1_back~0_134, ~n1~0=v_~n1~0_95, ~q1~0.base=v_~q1~0.base_96, #valid=|v_#valid_178|, #length=|v_#length_167|, #memory_int#1=|v_#memory_int#1_56|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_91, ~q1_front~0=v_~q1_front~0_95, ~n1~0=v_~n1~0_95, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_56|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_134, ~q1~0.base=v_~q1~0.base_96, #valid=|v_#valid_178|, #length=|v_#length_167|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][143], [Black: 495#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n1~0 2)), Black: 508#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 32#L70true, 243#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 190#(= (select |#valid| ~q1~0.base) 1), Black: 519#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 200#(<= ~q2_back~0 ~q2_front~0), 209#(= (select |#valid| ~q2~0.base) 1), Black: 274#(and (or (< ~N~0 (+ ~t~0 1)) (< (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1|) (+ ~t~0 1))) (or (< ~t~0 (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1| 1)) (< ~t~0 (+ ~N~0 1)))), 813#true, Black: 272#(and (<= 0 ~N~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~t~0 0)), 22#thread3EXITtrue, Black: 790#(and (= ~q1~0.offset 0) (or (and (<= ~q1_front~0 0) (or (not (= ~q1_front~0 0)) (not (= (select (select |#memory_int#1| ~q1~0.base) 0) 0)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 786#(and (or (not (= ~q1_back~0 0)) (and (or (< (+ ~q1_front~0 ~n1~0) 3) (< ~q1_front~0 1)) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_front~0 0))))) (= ~q1~0.offset 0) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_back~0 1) (< ~n1~0 3))), Black: 792#(and (<= ~q1_front~0 0) (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 794#(and (= ~q1~0.offset 0) (or (and (<= ~q1_front~0 0) (or (not (= ~q1_front~0 0)) (not (= (select (select |#memory_int#1| ~q1~0.base) 0) 0)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 776#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_back~0 0))) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 772#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= ~q1_back~0 ~q1_front~0) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_back~0 0))) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 613#(= |thread2Thread1of1ForFork0_~j~0#1| 1), Black: 780#(and (or (not (= ~q1_back~0 0)) (and (or (< (+ ~q1_front~0 ~n1~0) 3) (< ~q1_front~0 1)) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_front~0 0))))) (= ~q1~0.offset 0) (or (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_back~0 1) (< ~n1~0 3))), 522#true, 53#L47-4true, Black: 774#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1_back~0 ~q1_front~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 531#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 798#(and (<= ~q1_front~0 0) (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), 197#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))), 27#L121true, 268#true, Black: 820#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 518#(<= ~q2_back~0 ~q2_front~0), 129#(<= ~n2~0 2147483647), 279#true, 825#true, Black: 506#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)))]) [2025-01-10 01:12:24,775 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2025-01-10 01:12:24,775 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2025-01-10 01:12:24,775 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-01-10 01:12:24,775 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:12:24,776 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([724] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_front~0_96))) (let ((.cse0 (+ v_~q1~0.offset_91 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_96 v_~n1~0_95) (< v_~q1_front~0_96 v_~q1_back~0_134) (<= 0 v_~q1_front~0_96)) 1 0) 0)) (<= 0 .cse0) (= (select (select |v_#memory_int#1_56| v_~q1~0.base_96) .cse0) |v_thread2Thread1of1ForFork0_~j~0#1_3|) (= (+ v_~q1_front~0_96 1) v_~q1_front~0_95) (<= (+ v_~q1~0.offset_91 .cse1 4) (select |v_#length_167| v_~q1~0.base_96)) (= (select |v_#valid_178| v_~q1~0.base_96) 1)))) InVars {~q1~0.offset=v_~q1~0.offset_91, ~q1_front~0=v_~q1_front~0_96, ~q1_back~0=v_~q1_back~0_134, ~n1~0=v_~n1~0_95, ~q1~0.base=v_~q1~0.base_96, #valid=|v_#valid_178|, #length=|v_#length_167|, #memory_int#1=|v_#memory_int#1_56|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_91, ~q1_front~0=v_~q1_front~0_95, ~n1~0=v_~n1~0_95, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_56|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_134, ~q1~0.base=v_~q1~0.base_96, #valid=|v_#valid_178|, #length=|v_#length_167|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][143], [Black: 495#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n1~0 2)), 30#L120-4true, Black: 508#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 32#L70true, 243#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 190#(= (select |#valid| ~q1~0.base) 1), Black: 519#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 200#(<= ~q2_back~0 ~q2_front~0), 209#(= (select |#valid| ~q2~0.base) 1), 51#L54true, 813#true, Black: 274#(and (or (< ~N~0 (+ ~t~0 1)) (< (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1|) (+ ~t~0 1))) (or (< ~t~0 (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1| 1)) (< ~t~0 (+ ~N~0 1)))), Black: 272#(and (<= 0 ~N~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~t~0 0)), 22#thread3EXITtrue, Black: 790#(and (= ~q1~0.offset 0) (or (and (<= ~q1_front~0 0) (or (not (= ~q1_front~0 0)) (not (= (select (select |#memory_int#1| ~q1~0.base) 0) 0)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 786#(and (or (not (= ~q1_back~0 0)) (and (or (< (+ ~q1_front~0 ~n1~0) 3) (< ~q1_front~0 1)) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_front~0 0))))) (= ~q1~0.offset 0) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_back~0 1) (< ~n1~0 3))), Black: 792#(and (<= ~q1_front~0 0) (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 794#(and (= ~q1~0.offset 0) (or (and (<= ~q1_front~0 0) (or (not (= ~q1_front~0 0)) (not (= (select (select |#memory_int#1| ~q1~0.base) 0) 0)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 776#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_back~0 0))) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 772#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= ~q1_back~0 ~q1_front~0) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_back~0 0))) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 613#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 522#true, Black: 780#(and (or (not (= ~q1_back~0 0)) (and (or (< (+ ~q1_front~0 ~n1~0) 3) (< ~q1_front~0 1)) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_front~0 0))))) (= ~q1~0.offset 0) (or (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_back~0 1) (< ~n1~0 3))), Black: 774#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1_back~0 ~q1_front~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 531#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 798#(and (<= ~q1_front~0 0) (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), 197#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))), 268#true, Black: 820#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 518#(<= ~q2_back~0 ~q2_front~0), 129#(<= ~n2~0 2147483647), 279#true, 825#true, Black: 506#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)))]) [2025-01-10 01:12:24,776 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2025-01-10 01:12:24,776 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2025-01-10 01:12:24,776 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:12:24,776 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-01-10 01:12:24,787 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([724] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_front~0_96))) (let ((.cse0 (+ v_~q1~0.offset_91 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_96 v_~n1~0_95) (< v_~q1_front~0_96 v_~q1_back~0_134) (<= 0 v_~q1_front~0_96)) 1 0) 0)) (<= 0 .cse0) (= (select (select |v_#memory_int#1_56| v_~q1~0.base_96) .cse0) |v_thread2Thread1of1ForFork0_~j~0#1_3|) (= (+ v_~q1_front~0_96 1) v_~q1_front~0_95) (<= (+ v_~q1~0.offset_91 .cse1 4) (select |v_#length_167| v_~q1~0.base_96)) (= (select |v_#valid_178| v_~q1~0.base_96) 1)))) InVars {~q1~0.offset=v_~q1~0.offset_91, ~q1_front~0=v_~q1_front~0_96, ~q1_back~0=v_~q1_back~0_134, ~n1~0=v_~n1~0_95, ~q1~0.base=v_~q1~0.base_96, #valid=|v_#valid_178|, #length=|v_#length_167|, #memory_int#1=|v_#memory_int#1_56|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_91, ~q1_front~0=v_~q1_front~0_95, ~n1~0=v_~n1~0_95, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_56|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_134, ~q1~0.base=v_~q1~0.base_96, #valid=|v_#valid_178|, #length=|v_#length_167|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][143], [Black: 495#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n1~0 2)), Black: 508#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 32#L70true, 243#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 190#(= (select |#valid| ~q1~0.base) 1), Black: 519#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 200#(<= ~q2_back~0 ~q2_front~0), 209#(= (select |#valid| ~q2~0.base) 1), 51#L54true, Black: 274#(and (or (< ~N~0 (+ ~t~0 1)) (< (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1|) (+ ~t~0 1))) (or (< ~t~0 (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1| 1)) (< ~t~0 (+ ~N~0 1)))), 813#true, Black: 272#(and (<= 0 ~N~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~t~0 0)), 22#thread3EXITtrue, Black: 790#(and (= ~q1~0.offset 0) (or (and (<= ~q1_front~0 0) (or (not (= ~q1_front~0 0)) (not (= (select (select |#memory_int#1| ~q1~0.base) 0) 0)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 786#(and (or (not (= ~q1_back~0 0)) (and (or (< (+ ~q1_front~0 ~n1~0) 3) (< ~q1_front~0 1)) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_front~0 0))))) (= ~q1~0.offset 0) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_back~0 1) (< ~n1~0 3))), Black: 792#(and (<= ~q1_front~0 0) (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 794#(and (= ~q1~0.offset 0) (or (and (<= ~q1_front~0 0) (or (not (= ~q1_front~0 0)) (not (= (select (select |#memory_int#1| ~q1~0.base) 0) 0)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 776#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_back~0 0))) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 772#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= ~q1_back~0 ~q1_front~0) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_back~0 0))) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 613#(= |thread2Thread1of1ForFork0_~j~0#1| 1), Black: 780#(and (or (not (= ~q1_back~0 0)) (and (or (< (+ ~q1_front~0 ~n1~0) 3) (< ~q1_front~0 1)) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_front~0 0))))) (= ~q1~0.offset 0) (or (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_back~0 1) (< ~n1~0 3))), 522#true, Black: 774#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1_back~0 ~q1_front~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 531#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 798#(and (<= ~q1_front~0 0) (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), 197#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))), 27#L121true, 268#true, Black: 820#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 518#(<= ~q2_back~0 ~q2_front~0), 129#(<= ~n2~0 2147483647), 279#true, 825#true, Black: 506#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)))]) [2025-01-10 01:12:24,788 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2025-01-10 01:12:24,788 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-10 01:12:24,788 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2025-01-10 01:12:24,788 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-10 01:12:24,809 INFO L124 PetriNetUnfolderBase]: 8749/15478 cut-off events. [2025-01-10 01:12:24,809 INFO L125 PetriNetUnfolderBase]: For 29288/30424 co-relation queries the response was YES. [2025-01-10 01:12:24,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47997 conditions, 15478 events. 8749/15478 cut-off events. For 29288/30424 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 119158 event pairs, 2754 based on Foata normal form. 400/15479 useless extension candidates. Maximal degree in co-relation 39037. Up to 8164 conditions per place. [2025-01-10 01:12:24,907 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 131 selfloop transitions, 24 changer transitions 15/186 dead transitions. [2025-01-10 01:12:24,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 186 transitions, 1472 flow [2025-01-10 01:12:24,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:12:24,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:12:24,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2025-01-10 01:12:24,908 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2025-01-10 01:12:24,908 INFO L175 Difference]: Start difference. First operand has 116 places, 128 transitions, 891 flow. Second operand 4 states and 136 transitions. [2025-01-10 01:12:24,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 186 transitions, 1472 flow [2025-01-10 01:12:25,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 186 transitions, 1413 flow, removed 9 selfloop flow, removed 7 redundant places. [2025-01-10 01:12:25,059 INFO L231 Difference]: Finished difference. Result has 114 places, 126 transitions, 888 flow [2025-01-10 01:12:25,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=888, PETRI_PLACES=114, PETRI_TRANSITIONS=126} [2025-01-10 01:12:25,059 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 55 predicate places. [2025-01-10 01:12:25,059 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 126 transitions, 888 flow [2025-01-10 01:12:25,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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) [2025-01-10 01:12:25,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:25,061 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:25,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:12:25,061 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:12:25,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:25,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1239881762, now seen corresponding path program 1 times [2025-01-10 01:12:25,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:25,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150047741] [2025-01-10 01:12:25,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:25,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:25,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 01:12:25,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 01:12:25,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:25,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 01:12:25,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:25,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150047741] [2025-01-10 01:12:25,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150047741] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:25,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138250168] [2025-01-10 01:12:25,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:25,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:25,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:25,210 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:12:25,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:12:25,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 01:12:25,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 01:12:25,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:25,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:25,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:12:25,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:25,415 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 01:12:25,415 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 01:12:25,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138250168] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:12:25,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:12:25,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2025-01-10 01:12:25,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513687340] [2025-01-10 01:12:25,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:12:25,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 01:12:25,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:25,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 01:12:25,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:12:25,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-01-10 01:12:25,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 126 transitions, 888 flow. Second operand has 15 states, 15 states have (on average 20.8) internal successors, (312), 15 states have internal predecessors, (312), 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) [2025-01-10 01:12:25,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:25,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-01-10 01:12:25,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:27,247 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([724] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_front~0_96))) (let ((.cse0 (+ v_~q1~0.offset_91 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_96 v_~n1~0_95) (< v_~q1_front~0_96 v_~q1_back~0_134) (<= 0 v_~q1_front~0_96)) 1 0) 0)) (<= 0 .cse0) (= (select (select |v_#memory_int#1_56| v_~q1~0.base_96) .cse0) |v_thread2Thread1of1ForFork0_~j~0#1_3|) (= (+ v_~q1_front~0_96 1) v_~q1_front~0_95) (<= (+ v_~q1~0.offset_91 .cse1 4) (select |v_#length_167| v_~q1~0.base_96)) (= (select |v_#valid_178| v_~q1~0.base_96) 1)))) InVars {~q1~0.offset=v_~q1~0.offset_91, ~q1_front~0=v_~q1_front~0_96, ~q1_back~0=v_~q1_back~0_134, ~n1~0=v_~n1~0_95, ~q1~0.base=v_~q1~0.base_96, #valid=|v_#valid_178|, #length=|v_#length_167|, #memory_int#1=|v_#memory_int#1_56|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_91, ~q1_front~0=v_~q1_front~0_95, ~n1~0=v_~n1~0_95, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_56|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_134, ~q1~0.base=v_~q1~0.base_96, #valid=|v_#valid_178|, #length=|v_#length_167|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][199], [Black: 495#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n1~0 2)), 30#L120-4true, Black: 508#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 32#L70true, 243#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 190#(= (select |#valid| ~q1~0.base) 1), Black: 519#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 200#(<= ~q2_back~0 ~q2_front~0), 209#(= (select |#valid| ~q2~0.base) 1), 813#true, Black: 274#(and (or (< ~N~0 (+ ~t~0 1)) (< (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1|) (+ ~t~0 1))) (or (< ~t~0 (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1| 1)) (< ~t~0 (+ ~N~0 1)))), Black: 272#(and (<= 0 ~N~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~t~0 0)), 22#thread3EXITtrue, Black: 794#(and (= ~q1~0.offset 0) (or (and (<= ~q1_front~0 0) (or (not (= ~q1_front~0 0)) (not (= (select (select |#memory_int#1| ~q1~0.base) 0) 0)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 776#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_back~0 0))) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 772#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= ~q1_back~0 ~q1_front~0) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_back~0 0))) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 780#(and (or (not (= ~q1_back~0 0)) (and (or (< (+ ~q1_front~0 ~n1~0) 3) (< ~q1_front~0 1)) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_front~0 0))))) (= ~q1~0.offset 0) (or (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_back~0 1) (< ~n1~0 3))), 522#true, Black: 774#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1_back~0 ~q1_front~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 531#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 798#(and (<= ~q1_front~0 0) (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), 197#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))), 268#true, Black: 820#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 518#(<= ~q2_back~0 ~q2_front~0), 11#thread1EXITtrue, 129#(<= ~n2~0 2147483647), 279#true, Black: 827#(<= ~q1_back~0 ~q1_front~0), Black: 828#(<= ~q1_back~0 (+ ~q1_front~0 1)), 825#true, 833#(<= ~q2_front~0 ~q2_back~0), Black: 506#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)))]) [2025-01-10 01:12:27,248 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2025-01-10 01:12:27,248 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2025-01-10 01:12:27,248 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-10 01:12:27,248 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-10 01:12:27,306 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([724] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_front~0_96))) (let ((.cse0 (+ v_~q1~0.offset_91 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_96 v_~n1~0_95) (< v_~q1_front~0_96 v_~q1_back~0_134) (<= 0 v_~q1_front~0_96)) 1 0) 0)) (<= 0 .cse0) (= (select (select |v_#memory_int#1_56| v_~q1~0.base_96) .cse0) |v_thread2Thread1of1ForFork0_~j~0#1_3|) (= (+ v_~q1_front~0_96 1) v_~q1_front~0_95) (<= (+ v_~q1~0.offset_91 .cse1 4) (select |v_#length_167| v_~q1~0.base_96)) (= (select |v_#valid_178| v_~q1~0.base_96) 1)))) InVars {~q1~0.offset=v_~q1~0.offset_91, ~q1_front~0=v_~q1_front~0_96, ~q1_back~0=v_~q1_back~0_134, ~n1~0=v_~n1~0_95, ~q1~0.base=v_~q1~0.base_96, #valid=|v_#valid_178|, #length=|v_#length_167|, #memory_int#1=|v_#memory_int#1_56|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_91, ~q1_front~0=v_~q1_front~0_95, ~n1~0=v_~n1~0_95, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_56|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_134, ~q1~0.base=v_~q1~0.base_96, #valid=|v_#valid_178|, #length=|v_#length_167|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][199], [Black: 495#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n1~0 2)), Black: 508#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 32#L70true, 243#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 190#(= (select |#valid| ~q1~0.base) 1), Black: 519#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 200#(<= ~q2_back~0 ~q2_front~0), 209#(= (select |#valid| ~q2~0.base) 1), 813#true, Black: 274#(and (or (< ~N~0 (+ ~t~0 1)) (< (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1|) (+ ~t~0 1))) (or (< ~t~0 (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1| 1)) (< ~t~0 (+ ~N~0 1)))), Black: 272#(and (<= 0 ~N~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~t~0 0)), 22#thread3EXITtrue, Black: 794#(and (= ~q1~0.offset 0) (or (and (<= ~q1_front~0 0) (or (not (= ~q1_front~0 0)) (not (= (select (select |#memory_int#1| ~q1~0.base) 0) 0)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 776#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_back~0 0))) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 772#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= ~q1_back~0 ~q1_front~0) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_back~0 0))) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 522#true, Black: 780#(and (or (not (= ~q1_back~0 0)) (and (or (< (+ ~q1_front~0 ~n1~0) 3) (< ~q1_front~0 1)) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_front~0 0))))) (= ~q1~0.offset 0) (or (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_back~0 1) (< ~n1~0 3))), Black: 774#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1_back~0 ~q1_front~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 531#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 798#(and (<= ~q1_front~0 0) (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), 197#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))), 27#L121true, 268#true, Black: 820#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 518#(<= ~q2_back~0 ~q2_front~0), 11#thread1EXITtrue, 129#(<= ~n2~0 2147483647), 279#true, Black: 827#(<= ~q1_back~0 ~q1_front~0), Black: 828#(<= ~q1_back~0 (+ ~q1_front~0 1)), 825#true, 833#(<= ~q2_front~0 ~q2_back~0), Black: 506#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)))]) [2025-01-10 01:12:27,307 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2025-01-10 01:12:27,307 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:12:27,307 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2025-01-10 01:12:27,307 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2025-01-10 01:12:27,365 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([724] L65-1-->L70: Formula: (let ((.cse1 (* 4 v_~q1_front~0_96))) (let ((.cse0 (+ v_~q1~0.offset_91 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_96 v_~n1~0_95) (< v_~q1_front~0_96 v_~q1_back~0_134) (<= 0 v_~q1_front~0_96)) 1 0) 0)) (<= 0 .cse0) (= (select (select |v_#memory_int#1_56| v_~q1~0.base_96) .cse0) |v_thread2Thread1of1ForFork0_~j~0#1_3|) (= (+ v_~q1_front~0_96 1) v_~q1_front~0_95) (<= (+ v_~q1~0.offset_91 .cse1 4) (select |v_#length_167| v_~q1~0.base_96)) (= (select |v_#valid_178| v_~q1~0.base_96) 1)))) InVars {~q1~0.offset=v_~q1~0.offset_91, ~q1_front~0=v_~q1_front~0_96, ~q1_back~0=v_~q1_back~0_134, ~n1~0=v_~n1~0_95, ~q1~0.base=v_~q1~0.base_96, #valid=|v_#valid_178|, #length=|v_#length_167|, #memory_int#1=|v_#memory_int#1_56|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_91, ~q1_front~0=v_~q1_front~0_95, ~n1~0=v_~n1~0_95, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_56|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_134, ~q1~0.base=v_~q1~0.base_96, #valid=|v_#valid_178|, #length=|v_#length_167|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][199], [Black: 495#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n1~0 2)), Black: 508#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 32#L70true, 243#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 190#(= (select |#valid| ~q1~0.base) 1), Black: 519#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 200#(<= ~q2_back~0 ~q2_front~0), 209#(= (select |#valid| ~q2~0.base) 1), 813#true, Black: 274#(and (or (< ~N~0 (+ ~t~0 1)) (< (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1|) (+ ~t~0 1))) (or (< ~t~0 (+ ~N~0 |thread3Thread1of1ForFork1_~k~0#1| 1)) (< ~t~0 (+ ~N~0 1)))), Black: 272#(and (<= 0 ~N~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~t~0 0)), 22#thread3EXITtrue, Black: 794#(and (= ~q1~0.offset 0) (or (and (<= ~q1_front~0 0) (or (not (= ~q1_front~0 0)) (not (= (select (select |#memory_int#1| ~q1~0.base) 0) 0)))) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 776#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_back~0 0))) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 772#(and (= ~q1~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= ~q1_back~0 ~q1_front~0) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_back~0 0))) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 522#true, Black: 780#(and (or (not (= ~q1_back~0 0)) (and (or (< (+ ~q1_front~0 ~n1~0) 3) (< ~q1_front~0 1)) (or (< (mod |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1073741824) (not (= ~q1_front~0 0))))) (= ~q1~0.offset 0) (or (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< ~q1_back~0 1) (< ~n1~0 3))), Black: 774#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1_back~0 ~q1_front~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 531#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 798#(and (<= ~q1_front~0 0) (not (= 0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), 197#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))), 34#L121-1true, 268#true, Black: 820#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 518#(<= ~q2_back~0 ~q2_front~0), 129#(<= ~n2~0 2147483647), 279#true, Black: 827#(<= ~q1_back~0 ~q1_front~0), Black: 828#(<= ~q1_back~0 (+ ~q1_front~0 1)), 825#true, 833#(<= ~q2_front~0 ~q2_back~0), Black: 506#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)))]) [2025-01-10 01:12:27,365 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2025-01-10 01:12:27,365 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2025-01-10 01:12:27,365 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:12:27,366 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2025-01-10 01:12:27,445 INFO L124 PetriNetUnfolderBase]: 10830/19842 cut-off events. [2025-01-10 01:12:27,446 INFO L125 PetriNetUnfolderBase]: For 41205/42208 co-relation queries the response was YES. [2025-01-10 01:12:27,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62981 conditions, 19842 events. 10830/19842 cut-off events. For 41205/42208 co-relation queries the response was YES. Maximal size of possible extension queue 741. Compared 163653 event pairs, 6514 based on Foata normal form. 417/19916 useless extension candidates. Maximal degree in co-relation 62955. Up to 11842 conditions per place. [2025-01-10 01:12:27,613 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 90 selfloop transitions, 18 changer transitions 138/262 dead transitions. [2025-01-10 01:12:27,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 262 transitions, 2249 flow [2025-01-10 01:12:27,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:12:27,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:12:27,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 219 transitions. [2025-01-10 01:12:27,618 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40555555555555556 [2025-01-10 01:12:27,618 INFO L175 Difference]: Start difference. First operand has 114 places, 126 transitions, 888 flow. Second operand 9 states and 219 transitions. [2025-01-10 01:12:27,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 262 transitions, 2249 flow [2025-01-10 01:12:27,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 262 transitions, 2171 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-01-10 01:12:27,726 INFO L231 Difference]: Finished difference. Result has 114 places, 124 transitions, 835 flow [2025-01-10 01:12:27,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=835, PETRI_PLACES=114, PETRI_TRANSITIONS=124} [2025-01-10 01:12:27,726 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 55 predicate places. [2025-01-10 01:12:27,726 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 124 transitions, 835 flow [2025-01-10 01:12:27,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 20.8) internal successors, (312), 15 states have internal predecessors, (312), 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) [2025-01-10 01:12:27,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:27,727 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:27,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 01:12:27,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:27,927 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:12:27,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:27,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1294280530, now seen corresponding path program 2 times [2025-01-10 01:12:27,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:27,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962912834] [2025-01-10 01:12:27,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:12:27,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:27,936 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-01-10 01:12:27,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 01:12:27,962 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:12:27,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:28,328 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:12:28,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:28,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962912834] [2025-01-10 01:12:28,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962912834] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:28,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913828913] [2025-01-10 01:12:28,328 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:12:28,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:28,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:28,331 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:12:28,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:12:28,387 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-01-10 01:12:28,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 01:12:28,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:12:28,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:28,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-10 01:12:28,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:28,948 INFO L349 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2025-01-10 01:12:28,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 38 [2025-01-10 01:12:29,130 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:12:29,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:29,707 INFO L349 Elim1Store]: treesize reduction 23, result has 75.3 percent of original size [2025-01-10 01:12:29,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 82 [2025-01-10 01:12:30,097 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:12:30,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913828913] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:12:30,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:12:30,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 12] total 33 [2025-01-10 01:12:30,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699541633] [2025-01-10 01:12:30,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:12:30,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-10 01:12:30,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:30,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-10 01:12:30,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=963, Unknown=0, NotChecked=0, Total=1122 [2025-01-10 01:12:30,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 60 [2025-01-10 01:12:30,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 124 transitions, 835 flow. Second operand has 34 states, 34 states have (on average 14.205882352941176) internal successors, (483), 34 states have internal predecessors, (483), 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) [2025-01-10 01:12:30,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:30,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 60 [2025-01-10 01:12:30,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:52,940 INFO L124 PetriNetUnfolderBase]: 145772/214963 cut-off events. [2025-01-10 01:12:52,941 INFO L125 PetriNetUnfolderBase]: For 358459/358459 co-relation queries the response was YES. [2025-01-10 01:12:54,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664349 conditions, 214963 events. 145772/214963 cut-off events. For 358459/358459 co-relation queries the response was YES. Maximal size of possible extension queue 7404. Compared 1782718 event pairs, 4821 based on Foata normal form. 3532/202786 useless extension candidates. Maximal degree in co-relation 664323. Up to 26514 conditions per place. [2025-01-10 01:12:54,873 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 1389 selfloop transitions, 1013 changer transitions 487/2894 dead transitions. [2025-01-10 01:12:54,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 2894 transitions, 22608 flow [2025-01-10 01:12:54,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2025-01-10 01:12:54,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2025-01-10 01:12:54,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 2515 transitions. [2025-01-10 01:12:54,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3917445482866044 [2025-01-10 01:12:54,882 INFO L175 Difference]: Start difference. First operand has 114 places, 124 transitions, 835 flow. Second operand 107 states and 2515 transitions. [2025-01-10 01:12:54,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 2894 transitions, 22608 flow [2025-01-10 01:13:06,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 2894 transitions, 22470 flow, removed 49 selfloop flow, removed 7 redundant places. [2025-01-10 01:13:06,834 INFO L231 Difference]: Finished difference. Result has 287 places, 1179 transitions, 13639 flow [2025-01-10 01:13:06,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=107, PETRI_FLOW=13639, PETRI_PLACES=287, PETRI_TRANSITIONS=1179} [2025-01-10 01:13:06,835 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 228 predicate places. [2025-01-10 01:13:06,835 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 1179 transitions, 13639 flow [2025-01-10 01:13:06,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 14.205882352941176) internal successors, (483), 34 states have internal predecessors, (483), 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) [2025-01-10 01:13:06,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:06,835 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:06,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 01:13:07,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:07,036 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:13:07,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:07,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2019705668, now seen corresponding path program 3 times [2025-01-10 01:13:07,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:07,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827258666] [2025-01-10 01:13:07,037 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:13:07,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:07,045 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 4 equivalence classes. [2025-01-10 01:13:07,069 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 44 statements. [2025-01-10 01:13:07,069 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:13:07,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:13:07,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:07,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827258666] [2025-01-10 01:13:07,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827258666] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:07,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996826658] [2025-01-10 01:13:07,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:13:07,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:07,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:07,158 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:13:07,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 01:13:07,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 4 equivalence classes. [2025-01-10 01:13:07,278 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 44 statements. [2025-01-10 01:13:07,278 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:13:07,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:07,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 01:13:07,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:07,439 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 01:13:07,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:07,582 INFO L349 Elim1Store]: treesize reduction 23, result has 75.3 percent of original size [2025-01-10 01:13:07,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 82 [2025-01-10 01:13:07,653 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 01:13:07,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996826658] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:07,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:07,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 13 [2025-01-10 01:13:07,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582901109] [2025-01-10 01:13:07,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:07,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:13:07,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:07,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:13:07,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:13:07,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-01-10 01:13:07,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 1179 transitions, 13639 flow. Second operand has 14 states, 14 states have (on average 17.214285714285715) internal successors, (241), 14 states have internal predecessors, (241), 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) [2025-01-10 01:13:07,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:07,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-01-10 01:13:07,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand