./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-prod-cons.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-prod-cons.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 7225a3dc80a635bdf8bc0a0aebf3fff6c385d87e3635c30eb2fdc2ad9b10efb0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:11:50,163 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:11:50,219 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:11:50,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:11:50,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:11:50,240 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:11:50,241 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:11:50,241 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:11:50,241 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:11:50,241 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:11:50,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:11:50,245 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:11:50,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:11:50,245 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:11:50,245 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:11:50,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:11:50,245 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:11:50,245 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:11:50,245 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:11:50,245 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:11:50,245 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:11:50,245 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:11:50,245 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:11:50,245 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:11:50,245 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:11:50,245 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:11:50,245 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:11:50,246 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:11:50,246 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:11:50,246 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:11:50,246 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:11:50,246 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:11:50,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:11:50,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:11:50,246 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:11:50,246 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:11:50,246 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:11:50,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:11:50,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:11:50,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:11:50,246 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:11:50,246 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:11:50,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:11:50,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:11:50,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:11:50,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:11:50,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:11:50,246 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 -> 7225a3dc80a635bdf8bc0a0aebf3fff6c385d87e3635c30eb2fdc2ad9b10efb0 [2025-01-10 01:11:50,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:11:50,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:11:50,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:11:50,462 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:11:50,462 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:11:50,464 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-prod-cons.wvr.c [2025-01-10 01:11:51,631 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b07e0b3e/3645feeebcbb4f0aac8415aa8874cab6/FLAGc02d343e9 [2025-01-10 01:11:51,867 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:11:51,867 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons.wvr.c [2025-01-10 01:11:51,872 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b07e0b3e/3645feeebcbb4f0aac8415aa8874cab6/FLAGc02d343e9 [2025-01-10 01:11:51,881 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b07e0b3e/3645feeebcbb4f0aac8415aa8874cab6 [2025-01-10 01:11:51,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:11:51,883 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:11:51,884 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:11:51,884 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:11:51,887 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:11:51,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:11:51" (1/1) ... [2025-01-10 01:11:51,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3524fc82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:51, skipping insertion in model container [2025-01-10 01:11:51,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:11:51" (1/1) ... [2025-01-10 01:11:51,897 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:11:52,036 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:11:52,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:11:52,048 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:11:52,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:11:52,086 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:11:52,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:52 WrapperNode [2025-01-10 01:11:52,088 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:11:52,089 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:11:52,090 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:11:52,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:11:52,094 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:11:52" (1/1) ... [2025-01-10 01:11:52,099 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:11:52" (1/1) ... [2025-01-10 01:11:52,118 INFO L138 Inliner]: procedures = 24, calls = 36, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 149 [2025-01-10 01:11:52,118 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:11:52,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:11:52,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:11:52,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:11:52,127 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:52" (1/1) ... [2025-01-10 01:11:52,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:52" (1/1) ... [2025-01-10 01:11:52,133 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:52" (1/1) ... [2025-01-10 01:11:52,146 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-10 01:11:52,146 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:52" (1/1) ... [2025-01-10 01:11:52,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:52" (1/1) ... [2025-01-10 01:11:52,151 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:52" (1/1) ... [2025-01-10 01:11:52,152 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:52" (1/1) ... [2025-01-10 01:11:52,157 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:52" (1/1) ... [2025-01-10 01:11:52,159 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:52" (1/1) ... [2025-01-10 01:11:52,159 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:52" (1/1) ... [2025-01-10 01:11:52,162 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:11:52,163 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:11:52,163 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:11:52,163 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:11:52,164 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:52" (1/1) ... [2025-01-10 01:11:52,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:11:52,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:52,191 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:11:52,194 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:11:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:11:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:11:52,210 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:11:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:11:52,210 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:11:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:11:52,210 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:11:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:11:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:11:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:11:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:11:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 01:11:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 01:11:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:11:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:11:52,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:11:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:11:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:11:52,211 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:11:52,290 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:11:52,292 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:11:52,506 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:11:52,506 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:11:52,670 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:11:52,671 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:11:52,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:11:52 BoogieIcfgContainer [2025-01-10 01:11:52,671 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:11:52,673 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:11:52,673 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:11:52,677 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:11:52,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:11:51" (1/3) ... [2025-01-10 01:11:52,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7149537b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:11:52, skipping insertion in model container [2025-01-10 01:11:52,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:11:52" (2/3) ... [2025-01-10 01:11:52,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7149537b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:11:52, skipping insertion in model container [2025-01-10 01:11:52,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:11:52" (3/3) ... [2025-01-10 01:11:52,682 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons.wvr.c [2025-01-10 01:11:52,693 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:11:52,695 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-prod-cons.wvr.c that has 4 procedures, 43 locations, 1 initial locations, 3 loop locations, and 8 error locations. [2025-01-10 01:11:52,695 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:11:52,751 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 01:11:52,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 46 transitions, 113 flow [2025-01-10 01:11:52,797 INFO L124 PetriNetUnfolderBase]: 4/43 cut-off events. [2025-01-10 01:11:52,799 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:11:52,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 43 events. 4/43 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 93 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-01-10 01:11:52,802 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 46 transitions, 113 flow [2025-01-10 01:11:52,803 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 42 transitions, 102 flow [2025-01-10 01:11:52,808 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:11:52,816 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;@4683cc41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:11:52,817 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-01-10 01:11:52,821 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:11:52,821 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:11:52,821 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:11:52,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:52,822 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:11:52,822 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-10 01:11:52,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:52,827 INFO L85 PathProgramCache]: Analyzing trace with hash 455537, now seen corresponding path program 1 times [2025-01-10 01:11:52,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:52,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641079971] [2025-01-10 01:11:52,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:52,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:52,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:11:52,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:11:52,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:52,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:53,032 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:11:53,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:53,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641079971] [2025-01-10 01:11:53,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641079971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:53,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:53,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:11:53,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596864516] [2025-01-10 01:11:53,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:53,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:11:53,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:53,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:11:53,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:11:53,069 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2025-01-10 01:11:53,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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:11:53,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:53,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2025-01-10 01:11:53,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:53,270 INFO L124 PetriNetUnfolderBase]: 440/801 cut-off events. [2025-01-10 01:11:53,271 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-01-10 01:11:53,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1581 conditions, 801 events. 440/801 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5017 event pairs, 388 based on Foata normal form. 1/588 useless extension candidates. Maximal degree in co-relation 1481. Up to 672 conditions per place. [2025-01-10 01:11:53,278 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 24 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2025-01-10 01:11:53,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 148 flow [2025-01-10 01:11:53,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:11:53,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:11:53,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-01-10 01:11:53,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.572463768115942 [2025-01-10 01:11:53,291 INFO L175 Difference]: Start difference. First operand has 48 places, 42 transitions, 102 flow. Second operand 3 states and 79 transitions. [2025-01-10 01:11:53,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 148 flow [2025-01-10 01:11:53,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 39 transitions, 136 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:11:53,299 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 88 flow [2025-01-10 01:11:53,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2025-01-10 01:11:53,303 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -7 predicate places. [2025-01-10 01:11:53,303 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 88 flow [2025-01-10 01:11:53,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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:11:53,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:53,304 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:11:53,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:11:53,304 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-10 01:11:53,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:53,305 INFO L85 PathProgramCache]: Analyzing trace with hash 455538, now seen corresponding path program 1 times [2025-01-10 01:11:53,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:53,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905390542] [2025-01-10 01:11:53,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:53,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:53,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:11:53,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:11:53,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:53,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:53,525 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:11:53,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:53,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905390542] [2025-01-10 01:11:53,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905390542] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:53,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:53,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:11:53,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964613411] [2025-01-10 01:11:53,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:53,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:11:53,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:53,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:11:53,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:11:53,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2025-01-10 01:11:53,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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:11:53,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:53,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2025-01-10 01:11:53,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:53,662 INFO L124 PetriNetUnfolderBase]: 441/804 cut-off events. [2025-01-10 01:11:53,662 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:11:53,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1531 conditions, 804 events. 441/804 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5052 event pairs, 388 based on Foata normal form. 0/590 useless extension candidates. Maximal degree in co-relation 1509. Up to 677 conditions per place. [2025-01-10 01:11:53,666 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 26 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2025-01-10 01:11:53,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 156 flow [2025-01-10 01:11:53,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:11:53,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:11:53,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-01-10 01:11:53,667 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5380434782608695 [2025-01-10 01:11:53,667 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 88 flow. Second operand 4 states and 99 transitions. [2025-01-10 01:11:53,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 156 flow [2025-01-10 01:11:53,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:11:53,669 INFO L231 Difference]: Finished difference. Result has 44 places, 42 transitions, 111 flow [2025-01-10 01:11:53,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=44, PETRI_TRANSITIONS=42} [2025-01-10 01:11:53,669 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2025-01-10 01:11:53,670 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 111 flow [2025-01-10 01:11:53,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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:11:53,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:53,670 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:11:53,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:11:53,670 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-10 01:11:53,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:53,670 INFO L85 PathProgramCache]: Analyzing trace with hash 437786457, now seen corresponding path program 1 times [2025-01-10 01:11:53,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:53,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182587121] [2025-01-10 01:11:53,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:53,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:53,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:11:53,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:11:53,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:53,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:53,897 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:11:53,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:53,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182587121] [2025-01-10 01:11:53,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182587121] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:53,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8680503] [2025-01-10 01:11:53,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:53,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:53,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:53,905 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:11:53,908 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:11:53,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:11:53,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:11:53,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:53,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:53,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 01:11:53,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:54,038 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:11:54,189 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:11:54,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:54,273 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:11:54,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8680503] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:11:54,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:11:54,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:11:54,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971541354] [2025-01-10 01:11:54,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:11:54,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:54,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:54,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:54,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:54,299 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2025-01-10 01:11:54,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 111 flow. Second operand has 11 states, 11 states have (on average 18.363636363636363) internal successors, (202), 11 states have internal predecessors, (202), 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:11:54,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:54,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2025-01-10 01:11:54,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:54,562 INFO L124 PetriNetUnfolderBase]: 442/806 cut-off events. [2025-01-10 01:11:54,562 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:11:54,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1547 conditions, 806 events. 442/806 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5030 event pairs, 388 based on Foata normal form. 0/591 useless extension candidates. Maximal degree in co-relation 1516. Up to 674 conditions per place. [2025-01-10 01:11:54,567 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 22 selfloop transitions, 10 changer transitions 0/44 dead transitions. [2025-01-10 01:11:54,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 44 transitions, 183 flow [2025-01-10 01:11:54,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:11:54,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:11:54,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions. [2025-01-10 01:11:54,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46195652173913043 [2025-01-10 01:11:54,569 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 111 flow. Second operand 8 states and 170 transitions. [2025-01-10 01:11:54,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 44 transitions, 183 flow [2025-01-10 01:11:54,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 44 transitions, 180 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:11:54,571 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 136 flow [2025-01-10 01:11:54,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=136, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2025-01-10 01:11:54,571 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2025-01-10 01:11:54,571 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 136 flow [2025-01-10 01:11:54,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.363636363636363) internal successors, (202), 11 states have internal predecessors, (202), 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:11:54,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:54,572 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:54,581 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:11:54,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:54,776 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-10 01:11:54,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:54,778 INFO L85 PathProgramCache]: Analyzing trace with hash -19417275, now seen corresponding path program 1 times [2025-01-10 01:11:54,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:54,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049521264] [2025-01-10 01:11:54,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:54,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:54,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:11:54,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:11:54,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:54,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:54,839 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:11:54,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:54,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049521264] [2025-01-10 01:11:54,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049521264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:54,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:54,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:11:54,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222650137] [2025-01-10 01:11:54,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:54,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:11:54,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:54,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:11:54,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:11:54,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2025-01-10 01:11:54,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:11:54,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:54,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2025-01-10 01:11:54,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:54,931 INFO L124 PetriNetUnfolderBase]: 309/575 cut-off events. [2025-01-10 01:11:54,931 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:11:54,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 575 events. 309/575 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3252 event pairs, 263 based on Foata normal form. 0/462 useless extension candidates. Maximal degree in co-relation 1073. Up to 472 conditions per place. [2025-01-10 01:11:54,935 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 26 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2025-01-10 01:11:54,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 42 transitions, 192 flow [2025-01-10 01:11:54,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:11:54,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:11:54,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2025-01-10 01:11:54,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5108695652173914 [2025-01-10 01:11:54,938 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 136 flow. Second operand 4 states and 94 transitions. [2025-01-10 01:11:54,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 42 transitions, 192 flow [2025-01-10 01:11:54,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 42 transitions, 150 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-01-10 01:11:54,940 INFO L231 Difference]: Finished difference. Result has 43 places, 42 transitions, 98 flow [2025-01-10 01:11:54,941 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=43, PETRI_TRANSITIONS=42} [2025-01-10 01:11:54,941 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2025-01-10 01:11:54,942 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 98 flow [2025-01-10 01:11:54,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:11:54,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:54,942 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:54,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:11:54,943 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-10 01:11:54,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:54,943 INFO L85 PathProgramCache]: Analyzing trace with hash -19417274, now seen corresponding path program 1 times [2025-01-10 01:11:54,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:54,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785714670] [2025-01-10 01:11:54,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:54,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:54,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:11:54,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:11:54,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:54,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:55,031 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:11:55,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:55,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785714670] [2025-01-10 01:11:55,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785714670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:55,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:55,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:11:55,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207732663] [2025-01-10 01:11:55,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:55,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:11:55,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:55,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:11:55,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:11:55,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2025-01-10 01:11:55,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 98 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:11:55,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:55,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2025-01-10 01:11:55,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:55,124 INFO L124 PetriNetUnfolderBase]: 394/766 cut-off events. [2025-01-10 01:11:55,124 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:11:55,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1451 conditions, 766 events. 394/766 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4566 event pairs, 348 based on Foata normal form. 30/683 useless extension candidates. Maximal degree in co-relation 1065. Up to 477 conditions per place. [2025-01-10 01:11:55,128 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 42 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2025-01-10 01:11:55,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 224 flow [2025-01-10 01:11:55,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:11:55,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:11:55,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2025-01-10 01:11:55,129 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6413043478260869 [2025-01-10 01:11:55,130 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 98 flow. Second operand 4 states and 118 transitions. [2025-01-10 01:11:55,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 224 flow [2025-01-10 01:11:55,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 57 transitions, 219 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:11:55,131 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 108 flow [2025-01-10 01:11:55,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2025-01-10 01:11:55,131 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2025-01-10 01:11:55,132 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 108 flow [2025-01-10 01:11:55,132 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:11:55,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:55,132 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:55,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:11:55,132 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-10 01:11:55,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:55,132 INFO L85 PathProgramCache]: Analyzing trace with hash -885789761, now seen corresponding path program 1 times [2025-01-10 01:11:55,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:55,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785064159] [2025-01-10 01:11:55,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:55,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:55,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:11:55,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:11:55,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:55,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:55,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:11:55,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:55,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785064159] [2025-01-10 01:11:55,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785064159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:55,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:55,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:11:55,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962833497] [2025-01-10 01:11:55,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:55,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:11:55,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:55,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:11:55,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:11:55,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2025-01-10 01:11:55,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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:11:55,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:55,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2025-01-10 01:11:55,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:55,397 INFO L124 PetriNetUnfolderBase]: 285/575 cut-off events. [2025-01-10 01:11:55,397 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-01-10 01:11:55,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1140 conditions, 575 events. 285/575 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3147 event pairs, 247 based on Foata normal form. 0/523 useless extension candidates. Maximal degree in co-relation 765. Up to 462 conditions per place. [2025-01-10 01:11:55,400 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 24 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2025-01-10 01:11:55,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 40 transitions, 156 flow [2025-01-10 01:11:55,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:11:55,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:11:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-01-10 01:11:55,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2025-01-10 01:11:55,401 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 108 flow. Second operand 4 states and 96 transitions. [2025-01-10 01:11:55,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 40 transitions, 156 flow [2025-01-10 01:11:55,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 151 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:11:55,402 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 103 flow [2025-01-10 01:11:55,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=103, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2025-01-10 01:11:55,403 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2025-01-10 01:11:55,403 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 103 flow [2025-01-10 01:11:55,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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:11:55,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:55,403 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] [2025-01-10 01:11:55,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:11:55,404 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-10 01:11:55,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:55,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1415163099, now seen corresponding path program 1 times [2025-01-10 01:11:55,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:55,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180641093] [2025-01-10 01:11:55,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:55,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:55,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:11:55,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:11:55,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:55,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:55,492 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:11:55,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:55,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180641093] [2025-01-10 01:11:55,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180641093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:55,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:55,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:11:55,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668584912] [2025-01-10 01:11:55,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:55,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:11:55,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:55,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:11:55,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:11:55,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2025-01-10 01:11:55,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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:11:55,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:55,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2025-01-10 01:11:55,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:55,616 INFO L124 PetriNetUnfolderBase]: 566/1020 cut-off events. [2025-01-10 01:11:55,616 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-01-10 01:11:55,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2062 conditions, 1020 events. 566/1020 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5381 event pairs, 111 based on Foata normal form. 62/1072 useless extension candidates. Maximal degree in co-relation 1430. Up to 460 conditions per place. [2025-01-10 01:11:55,622 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 54 selfloop transitions, 5 changer transitions 0/68 dead transitions. [2025-01-10 01:11:55,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 68 transitions, 291 flow [2025-01-10 01:11:55,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:11:55,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:11:55,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-01-10 01:11:55,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2025-01-10 01:11:55,623 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 103 flow. Second operand 5 states and 130 transitions. [2025-01-10 01:11:55,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 68 transitions, 291 flow [2025-01-10 01:11:55,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 68 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:11:55,625 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 129 flow [2025-01-10 01:11:55,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2025-01-10 01:11:55,631 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2025-01-10 01:11:55,631 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 129 flow [2025-01-10 01:11:55,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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:11:55,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:55,631 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] [2025-01-10 01:11:55,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:11:55,632 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-10 01:11:55,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:55,632 INFO L85 PathProgramCache]: Analyzing trace with hash 215588901, now seen corresponding path program 2 times [2025-01-10 01:11:55,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:55,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986173269] [2025-01-10 01:11:55,632 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:11:55,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:55,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:11:55,644 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:11:55,644 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:11:55,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:55,735 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:11:55,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:55,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986173269] [2025-01-10 01:11:55,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986173269] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:55,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:55,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:11:55,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668650697] [2025-01-10 01:11:55,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:55,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:11:55,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:55,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:11:55,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:11:55,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2025-01-10 01:11:55,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:55,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:55,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2025-01-10 01:11:55,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:55,879 INFO L124 PetriNetUnfolderBase]: 907/1572 cut-off events. [2025-01-10 01:11:55,879 INFO L125 PetriNetUnfolderBase]: For 618/627 co-relation queries the response was YES. [2025-01-10 01:11:55,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3673 conditions, 1572 events. 907/1572 cut-off events. For 618/627 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8743 event pairs, 394 based on Foata normal form. 12/1528 useless extension candidates. Maximal degree in co-relation 3104. Up to 668 conditions per place. [2025-01-10 01:11:55,886 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 48 selfloop transitions, 5 changer transitions 5/70 dead transitions. [2025-01-10 01:11:55,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 70 transitions, 326 flow [2025-01-10 01:11:55,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:11:55,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:11:55,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2025-01-10 01:11:55,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5782608695652174 [2025-01-10 01:11:55,887 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 129 flow. Second operand 5 states and 133 transitions. [2025-01-10 01:11:55,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 70 transitions, 326 flow [2025-01-10 01:11:55,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 70 transitions, 323 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:11:55,889 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 151 flow [2025-01-10 01:11:55,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2025-01-10 01:11:55,889 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 6 predicate places. [2025-01-10 01:11:55,889 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 151 flow [2025-01-10 01:11:55,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:55,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:55,889 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] [2025-01-10 01:11:55,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:11:55,889 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-10 01:11:55,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:55,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2096059433, now seen corresponding path program 1 times [2025-01-10 01:11:55,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:55,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797679602] [2025-01-10 01:11:55,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:55,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:55,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:11:55,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:11:55,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:55,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:55,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:11:55,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:55,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797679602] [2025-01-10 01:11:55,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797679602] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:55,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:55,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:11:55,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870695347] [2025-01-10 01:11:55,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:55,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:11:55,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:55,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:11:55,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:11:55,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2025-01-10 01:11:55,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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:11:55,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:55,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2025-01-10 01:11:55,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:56,021 INFO L124 PetriNetUnfolderBase]: 503/1025 cut-off events. [2025-01-10 01:11:56,021 INFO L125 PetriNetUnfolderBase]: For 410/443 co-relation queries the response was YES. [2025-01-10 01:11:56,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2263 conditions, 1025 events. 503/1025 cut-off events. For 410/443 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5814 event pairs, 193 based on Foata normal form. 28/931 useless extension candidates. Maximal degree in co-relation 2228. Up to 559 conditions per place. [2025-01-10 01:11:56,027 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 34 selfloop transitions, 2 changer transitions 4/57 dead transitions. [2025-01-10 01:11:56,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 268 flow [2025-01-10 01:11:56,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:11:56,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:11:56,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-01-10 01:11:56,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6521739130434783 [2025-01-10 01:11:56,029 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 151 flow. Second operand 3 states and 90 transitions. [2025-01-10 01:11:56,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 268 flow [2025-01-10 01:11:56,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 57 transitions, 263 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:11:56,032 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 160 flow [2025-01-10 01:11:56,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2025-01-10 01:11:56,032 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 6 predicate places. [2025-01-10 01:11:56,032 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 160 flow [2025-01-10 01:11:56,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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:11:56,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:56,033 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:11:56,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:11:56,033 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-10 01:11:56,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:56,033 INFO L85 PathProgramCache]: Analyzing trace with hash 65329414, now seen corresponding path program 1 times [2025-01-10 01:11:56,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:56,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014705331] [2025-01-10 01:11:56,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:56,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:56,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:11:56,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:11:56,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:56,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:56,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:11:56,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:56,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014705331] [2025-01-10 01:11:56,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014705331] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:56,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917917929] [2025-01-10 01:11:56,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:56,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:56,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:56,640 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:11:56,643 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:11:56,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:11:56,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:11:56,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:56,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:56,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-10 01:11:56,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:56,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-10 01:11:57,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:11:57,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:57,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2025-01-10 01:11:57,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:11:57,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 46 [2025-01-10 01:11:57,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:11:57,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917917929] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:11:57,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:11:57,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2025-01-10 01:11:57,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010882456] [2025-01-10 01:11:57,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:11:57,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-10 01:11:57,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:57,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-10 01:11:57,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2025-01-10 01:11:57,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2025-01-10 01:11:57,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 160 flow. Second operand has 28 states, 28 states have (on average 16.785714285714285) internal successors, (470), 28 states have internal predecessors, (470), 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:11:57,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:57,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2025-01-10 01:11:57,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:00,062 INFO L124 PetriNetUnfolderBase]: 4804/8231 cut-off events. [2025-01-10 01:12:00,062 INFO L125 PetriNetUnfolderBase]: For 6282/6418 co-relation queries the response was YES. [2025-01-10 01:12:00,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20742 conditions, 8231 events. 4804/8231 cut-off events. For 6282/6418 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 55507 event pairs, 491 based on Foata normal form. 137/7770 useless extension candidates. Maximal degree in co-relation 9859. Up to 1370 conditions per place. [2025-01-10 01:12:00,094 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 248 selfloop transitions, 79 changer transitions 108/445 dead transitions. [2025-01-10 01:12:00,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 445 transitions, 2368 flow [2025-01-10 01:12:00,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-01-10 01:12:00,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-01-10 01:12:00,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 989 transitions. [2025-01-10 01:12:00,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.524390243902439 [2025-01-10 01:12:00,099 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 160 flow. Second operand 41 states and 989 transitions. [2025-01-10 01:12:00,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 445 transitions, 2368 flow [2025-01-10 01:12:00,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 445 transitions, 2294 flow, removed 33 selfloop flow, removed 2 redundant places. [2025-01-10 01:12:00,108 INFO L231 Difference]: Finished difference. Result has 103 places, 138 transitions, 822 flow [2025-01-10 01:12:00,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=822, PETRI_PLACES=103, PETRI_TRANSITIONS=138} [2025-01-10 01:12:00,109 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 55 predicate places. [2025-01-10 01:12:00,109 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 138 transitions, 822 flow [2025-01-10 01:12:00,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 16.785714285714285) internal successors, (470), 28 states have internal predecessors, (470), 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:00,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:00,109 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:00,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:12:00,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:00,314 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-10 01:12:00,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:00,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1577280169, now seen corresponding path program 2 times [2025-01-10 01:12:00,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:00,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096992415] [2025-01-10 01:12:00,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:12:00,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:00,325 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-01-10 01:12:00,337 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 01:12:00,337 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:12:00,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:00,388 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:12:00,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:00,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096992415] [2025-01-10 01:12:00,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096992415] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:00,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439522573] [2025-01-10 01:12:00,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:12:00,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:00,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:00,390 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:00,391 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:00,426 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-01-10 01:12:00,444 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 01:12:00,445 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:12:00,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:00,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:12:00,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:00,499 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:12:00,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:00,568 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:12:00,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439522573] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:12:00,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:12:00,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2025-01-10 01:12:00,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892121174] [2025-01-10 01:12:00,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:12:00,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:12:00,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:00,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:12:00,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:12:00,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2025-01-10 01:12:00,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 138 transitions, 822 flow. Second operand has 12 states, 12 states have (on average 21.916666666666668) internal successors, (263), 12 states have internal predecessors, (263), 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:00,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:00,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2025-01-10 01:12:00,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:00,965 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L48-6-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_1|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_7|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_#res#1.base][136], [Black: 123#(= ~v_assert~0 1), Black: 126#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 1)), 32#L90true, 145#true, Black: 134#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 143#(= ~back~0 ~front~0), 124#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), 138#(and (<= 1 ~v_assert~0) (= ~d~0 0) (<= (div ~v_assert~0 256) 0) (<= 0 ~W~0)), 446#(= ~back~0 ~front~0), 120#(and (<= (* ~n~0 4) (select |#length| ~queue~0.base)) (= ~queue~0.offset 0)), 110#(= (select |#valid| ~queue~0.base) 1), Black: 408#(and (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (< ~front~0 0)) (or (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 424#(and (= ~v_assert~0 1) (<= ~d~0 ~W~0)), Black: 378#(and (or (not (= (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (< ~back~0 0) (< (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~d~0) 2) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~v_assert~0 1)), Black: 400#(and (or (< ~back~0 0) (and (= ~back~0 ~front~0) (<= ~d~0 0)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (< ~front~0 0)) (or (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 382#(and (or (< ~back~0 0) (and (= ~back~0 ~front~0) (<= ~d~0 0)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (< ~front~0 0)) (or (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 390#(and (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (< ~front~0 0)) (or (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 404#(and (= |thread2Thread1of1ForFork1_~temp~0#1| 1) (or (and (= ~queue~0.offset 0) (= ~front~0 0)) (not (= ~back~0 0))) (= ~d~0 0) (= ~v_assert~0 1) (or (< ~back~0 1) (< ~n~0 2)) (or (< (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (+ ~W~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 1 ~W~0) (or (not (= ~back~0 0)) (< |thread1Thread1of1ForFork0_~w~0#1| (+ ~W~0 1)))), 12#thread1EXITtrue, Black: 398#(and (= ~v_assert~0 1) (or (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), 28#L75true, Black: 416#(and (<= ~d~0 1) (= ~v_assert~0 1) (<= 1 ~W~0)), 31#L111true, Black: 239#(= ~v_assert~0 1), Black: 374#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~w~0#1| ~W~0) (<= ~d~0 ~W~0) (<= ~d~0 0) (<= ~n~0 1) (or (not (= ~back~0 0)) (and (= ~d~0 0) (= ~queue~0.offset 0))))]) [2025-01-10 01:12:00,966 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-01-10 01:12:00,966 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 01:12:00,966 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 01:12:00,966 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-10 01:12:00,991 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L48-6-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_1|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_7|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_#res#1.base][136], [Black: 123#(= ~v_assert~0 1), Black: 126#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 1)), 32#L90true, 145#true, 134#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 138#(and (<= 1 ~v_assert~0) (= ~d~0 0) (<= (div ~v_assert~0 256) 0) (<= 0 ~W~0)), Black: 143#(= ~back~0 ~front~0), 124#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), 446#(= ~back~0 ~front~0), 120#(and (<= (* ~n~0 4) (select |#length| ~queue~0.base)) (= ~queue~0.offset 0)), 110#(= (select |#valid| ~queue~0.base) 1), 3#L78true, Black: 408#(and (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (< ~front~0 0)) (or (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 424#(and (= ~v_assert~0 1) (<= ~d~0 ~W~0)), Black: 378#(and (or (not (= (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (< ~back~0 0) (< (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~d~0) 2) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~v_assert~0 1)), Black: 400#(and (or (< ~back~0 0) (and (= ~back~0 ~front~0) (<= ~d~0 0)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (< ~front~0 0)) (or (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 382#(and (or (< ~back~0 0) (and (= ~back~0 ~front~0) (<= ~d~0 0)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (< ~front~0 0)) (or (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 390#(and (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (< ~front~0 0)) (or (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 404#(and (= |thread2Thread1of1ForFork1_~temp~0#1| 1) (or (and (= ~queue~0.offset 0) (= ~front~0 0)) (not (= ~back~0 0))) (= ~d~0 0) (= ~v_assert~0 1) (or (< ~back~0 1) (< ~n~0 2)) (or (< (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (+ ~W~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 1 ~W~0) (or (not (= ~back~0 0)) (< |thread1Thread1of1ForFork0_~w~0#1| (+ ~W~0 1)))), Black: 398#(and (= ~v_assert~0 1) (or (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), 12#thread1EXITtrue, Black: 416#(and (<= ~d~0 1) (= ~v_assert~0 1) (<= 1 ~W~0)), 31#L111true, Black: 239#(= ~v_assert~0 1), Black: 374#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~w~0#1| ~W~0) (<= ~d~0 ~W~0) (<= ~d~0 0) (<= ~n~0 1) (or (not (= ~back~0 0)) (and (= ~d~0 0) (= ~queue~0.offset 0))))]) [2025-01-10 01:12:00,991 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-01-10 01:12:00,991 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 01:12:00,991 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 01:12:00,991 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 01:12:01,330 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L48-6-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_1|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_7|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_#res#1.base][136], [Black: 123#(= ~v_assert~0 1), Black: 126#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 1)), 32#L90true, 145#true, Black: 138#(and (<= 1 ~v_assert~0) (= ~d~0 0) (<= (div ~v_assert~0 256) 0) (<= 0 ~W~0)), Black: 134#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 143#(= ~back~0 ~front~0), 124#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), 446#(= ~back~0 ~front~0), 120#(and (<= (* ~n~0 4) (select |#length| ~queue~0.base)) (= ~queue~0.offset 0)), 110#(= (select |#valid| ~queue~0.base) 1), Black: 408#(and (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (< ~front~0 0)) (or (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 424#(and (= ~v_assert~0 1) (<= ~d~0 ~W~0)), Black: 378#(and (or (not (= (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (< ~back~0 0) (< (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~d~0) 2) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~v_assert~0 1)), Black: 400#(and (or (< ~back~0 0) (and (= ~back~0 ~front~0) (<= ~d~0 0)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (< ~front~0 0)) (or (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 382#(and (or (< ~back~0 0) (and (= ~back~0 ~front~0) (<= ~d~0 0)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (< ~front~0 0)) (or (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 390#(and (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (< ~front~0 0)) (or (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 404#(and (= |thread2Thread1of1ForFork1_~temp~0#1| 1) (or (and (= ~queue~0.offset 0) (= ~front~0 0)) (not (= ~back~0 0))) (= ~d~0 0) (= ~v_assert~0 1) (or (< ~back~0 1) (< ~n~0 2)) (or (< (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (+ ~W~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 1 ~W~0) (or (not (= ~back~0 0)) (< |thread1Thread1of1ForFork0_~w~0#1| (+ ~W~0 1)))), Black: 398#(and (= ~v_assert~0 1) (or (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), 28#L75true, 12#thread1EXITtrue, 31#L111true, Black: 416#(and (<= ~d~0 1) (= ~v_assert~0 1) (<= 1 ~W~0)), Black: 239#(= ~v_assert~0 1), Black: 374#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~w~0#1| ~W~0) (<= ~d~0 ~W~0) (<= ~d~0 0) (<= ~n~0 1) (or (not (= ~back~0 0)) (and (= ~d~0 0) (= ~queue~0.offset 0))))]) [2025-01-10 01:12:01,330 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2025-01-10 01:12:01,330 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2025-01-10 01:12:01,330 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-10 01:12:01,330 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2025-01-10 01:12:01,346 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L48-6-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_1|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_7|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_#res#1.base][136], [Black: 123#(= ~v_assert~0 1), Black: 126#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 1)), 32#L90true, 145#true, Black: 138#(and (<= 1 ~v_assert~0) (= ~d~0 0) (<= (div ~v_assert~0 256) 0) (<= 0 ~W~0)), Black: 134#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 143#(= ~back~0 ~front~0), 124#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), 446#(= ~back~0 ~front~0), 120#(and (<= (* ~n~0 4) (select |#length| ~queue~0.base)) (= ~queue~0.offset 0)), 110#(= (select |#valid| ~queue~0.base) 1), 3#L78true, Black: 408#(and (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (< ~front~0 0)) (or (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 424#(and (= ~v_assert~0 1) (<= ~d~0 ~W~0)), Black: 378#(and (or (not (= (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (< ~back~0 0) (< (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~d~0) 2) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~v_assert~0 1)), Black: 400#(and (or (< ~back~0 0) (and (= ~back~0 ~front~0) (<= ~d~0 0)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (< ~front~0 0)) (or (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 382#(and (or (< ~back~0 0) (and (= ~back~0 ~front~0) (<= ~d~0 0)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (< ~front~0 0)) (or (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 390#(and (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (< ~front~0 0)) (or (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 404#(and (= |thread2Thread1of1ForFork1_~temp~0#1| 1) (or (and (= ~queue~0.offset 0) (= ~front~0 0)) (not (= ~back~0 0))) (= ~d~0 0) (= ~v_assert~0 1) (or (< ~back~0 1) (< ~n~0 2)) (or (< (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (+ ~W~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (<= 1 ~W~0) (or (not (= ~back~0 0)) (< |thread1Thread1of1ForFork0_~w~0#1| (+ ~W~0 1)))), Black: 398#(and (= ~v_assert~0 1) (or (< (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1)) (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), 12#thread1EXITtrue, 31#L111true, Black: 416#(and (<= ~d~0 1) (= ~v_assert~0 1) (<= 1 ~W~0)), Black: 239#(= ~v_assert~0 1), Black: 374#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~w~0#1| ~W~0) (<= ~d~0 ~W~0) (<= ~d~0 0) (<= ~n~0 1) (or (not (= ~back~0 0)) (and (= ~d~0 0) (= ~queue~0.offset 0))))]) [2025-01-10 01:12:01,346 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2025-01-10 01:12:01,346 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 01:12:01,346 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2025-01-10 01:12:01,346 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-10 01:12:01,394 INFO L124 PetriNetUnfolderBase]: 4437/9027 cut-off events. [2025-01-10 01:12:01,395 INFO L125 PetriNetUnfolderBase]: For 12090/12647 co-relation queries the response was YES. [2025-01-10 01:12:01,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25173 conditions, 9027 events. 4437/9027 cut-off events. For 12090/12647 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 74263 event pairs, 929 based on Foata normal form. 507/8712 useless extension candidates. Maximal degree in co-relation 22959. Up to 1807 conditions per place. [2025-01-10 01:12:01,444 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 86 selfloop transitions, 24 changer transitions 78/242 dead transitions. [2025-01-10 01:12:01,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 242 transitions, 1538 flow [2025-01-10 01:12:01,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:12:01,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 01:12:01,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 338 transitions. [2025-01-10 01:12:01,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6123188405797102 [2025-01-10 01:12:01,450 INFO L175 Difference]: Start difference. First operand has 103 places, 138 transitions, 822 flow. Second operand 12 states and 338 transitions. [2025-01-10 01:12:01,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 242 transitions, 1538 flow [2025-01-10 01:12:01,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 242 transitions, 1499 flow, removed 17 selfloop flow, removed 2 redundant places. [2025-01-10 01:12:01,487 INFO L231 Difference]: Finished difference. Result has 111 places, 122 transitions, 805 flow [2025-01-10 01:12:01,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=805, PETRI_PLACES=111, PETRI_TRANSITIONS=122} [2025-01-10 01:12:01,488 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 63 predicate places. [2025-01-10 01:12:01,488 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 122 transitions, 805 flow [2025-01-10 01:12:01,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 21.916666666666668) internal successors, (263), 12 states have internal predecessors, (263), 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:01,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:01,488 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 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:01,497 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:01,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:01,693 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-10 01:12:01,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:01,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1156132093, now seen corresponding path program 3 times [2025-01-10 01:12:01,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:01,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000326016] [2025-01-10 01:12:01,694 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:12:01,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:01,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 5 equivalence classes. [2025-01-10 01:12:01,717 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 33 of 39 statements. [2025-01-10 01:12:01,717 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:12:01,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:02,000 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-10 01:12:02,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:02,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000326016] [2025-01-10 01:12:02,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000326016] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:02,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574576204] [2025-01-10 01:12:02,001 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:12:02,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:02,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:02,004 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:02,006 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:02,051 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 5 equivalence classes. [2025-01-10 01:12:02,069 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 33 of 39 statements. [2025-01-10 01:12:02,069 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:12:02,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:02,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 01:12:02,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:02,274 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-10 01:12:02,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:02,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:12:02,342 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 28 treesize of output 20 [2025-01-10 01:12:02,411 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-10 01:12:02,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574576204] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:12:02,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:12:02,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-01-10 01:12:02,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822821603] [2025-01-10 01:12:02,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:12:02,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 01:12:02,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:02,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 01:12:02,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:12:02,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2025-01-10 01:12:02,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 122 transitions, 805 flow. Second operand has 21 states, 21 states have (on average 17.238095238095237) internal successors, (362), 21 states have internal predecessors, (362), 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:02,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:02,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2025-01-10 01:12:02,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:04,126 INFO L124 PetriNetUnfolderBase]: 9028/15546 cut-off events. [2025-01-10 01:12:04,126 INFO L125 PetriNetUnfolderBase]: For 33588/33966 co-relation queries the response was YES. [2025-01-10 01:12:04,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50788 conditions, 15546 events. 9028/15546 cut-off events. For 33588/33966 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 110209 event pairs, 711 based on Foata normal form. 311/15479 useless extension candidates. Maximal degree in co-relation 50741. Up to 4096 conditions per place. [2025-01-10 01:12:04,207 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 121 selfloop transitions, 59 changer transitions 138/327 dead transitions. [2025-01-10 01:12:04,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 327 transitions, 2548 flow [2025-01-10 01:12:04,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 01:12:04,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-10 01:12:04,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 397 transitions. [2025-01-10 01:12:04,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5394021739130435 [2025-01-10 01:12:04,210 INFO L175 Difference]: Start difference. First operand has 111 places, 122 transitions, 805 flow. Second operand 16 states and 397 transitions. [2025-01-10 01:12:04,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 327 transitions, 2548 flow [2025-01-10 01:12:04,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 327 transitions, 2448 flow, removed 46 selfloop flow, removed 6 redundant places. [2025-01-10 01:12:04,260 INFO L231 Difference]: Finished difference. Result has 116 places, 113 transitions, 948 flow [2025-01-10 01:12:04,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=948, PETRI_PLACES=116, PETRI_TRANSITIONS=113} [2025-01-10 01:12:04,261 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 68 predicate places. [2025-01-10 01:12:04,261 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 113 transitions, 948 flow [2025-01-10 01:12:04,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 17.238095238095237) internal successors, (362), 21 states have internal predecessors, (362), 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:04,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:04,261 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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] [2025-01-10 01:12:04,267 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:04,461 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,SelfDestructingSolverStorable11 [2025-01-10 01:12:04,462 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-10 01:12:04,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:04,462 INFO L85 PathProgramCache]: Analyzing trace with hash 22589199, now seen corresponding path program 4 times [2025-01-10 01:12:04,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:04,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144461087] [2025-01-10 01:12:04,462 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:12:04,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:04,480 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-01-10 01:12:04,519 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 01:12:04,519 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:12:04,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:05,226 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:12:05,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:05,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144461087] [2025-01-10 01:12:05,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144461087] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:05,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533215587] [2025-01-10 01:12:05,227 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:12:05,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:05,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:05,229 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:05,231 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:05,268 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-01-10 01:12:05,291 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 01:12:05,291 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:12:05,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:05,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-10 01:12:05,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:12:05,824 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:06,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:12:06,103 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 51 treesize of output 53 [2025-01-10 01:12:06,396 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:12:06,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533215587] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:12:06,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:12:06,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 41 [2025-01-10 01:12:06,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946051147] [2025-01-10 01:12:06,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:12:06,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-01-10 01:12:06,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:06,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-01-10 01:12:06,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1492, Unknown=0, NotChecked=0, Total=1722 [2025-01-10 01:12:06,601 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2025-01-10 01:12:06,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 113 transitions, 948 flow. Second operand has 42 states, 42 states have (on average 16.238095238095237) internal successors, (682), 42 states have internal predecessors, (682), 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:06,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:06,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2025-01-10 01:12:06,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:17,788 INFO L124 PetriNetUnfolderBase]: 9788/17330 cut-off events. [2025-01-10 01:12:17,789 INFO L125 PetriNetUnfolderBase]: For 71626/72164 co-relation queries the response was YES. [2025-01-10 01:12:17,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71024 conditions, 17330 events. 9788/17330 cut-off events. For 71626/72164 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 127505 event pairs, 413 based on Foata normal form. 479/17227 useless extension candidates. Maximal degree in co-relation 61343. Up to 2741 conditions per place. [2025-01-10 01:12:17,950 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 837 selfloop transitions, 485 changer transitions 206/1537 dead transitions. [2025-01-10 01:12:17,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 1537 transitions, 12366 flow [2025-01-10 01:12:17,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2025-01-10 01:12:17,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2025-01-10 01:12:17,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 3691 transitions. [2025-01-10 01:12:17,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4747877540519681 [2025-01-10 01:12:17,970 INFO L175 Difference]: Start difference. First operand has 116 places, 113 transitions, 948 flow. Second operand 169 states and 3691 transitions. [2025-01-10 01:12:17,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 1537 transitions, 12366 flow [2025-01-10 01:12:18,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 1537 transitions, 10860 flow, removed 440 selfloop flow, removed 14 redundant places. [2025-01-10 01:12:18,816 INFO L231 Difference]: Finished difference. Result has 319 places, 556 transitions, 5893 flow [2025-01-10 01:12:18,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=169, PETRI_FLOW=5893, PETRI_PLACES=319, PETRI_TRANSITIONS=556} [2025-01-10 01:12:18,817 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 271 predicate places. [2025-01-10 01:12:18,817 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 556 transitions, 5893 flow [2025-01-10 01:12:18,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 16.238095238095237) internal successors, (682), 42 states have internal predecessors, (682), 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,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:18,817 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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] [2025-01-10 01:12:18,824 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:19,018 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,SelfDestructingSolverStorable12 [2025-01-10 01:12:19,018 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-10 01:12:19,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:19,019 INFO L85 PathProgramCache]: Analyzing trace with hash -288691781, now seen corresponding path program 5 times [2025-01-10 01:12:19,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:19,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905306251] [2025-01-10 01:12:19,019 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:12:19,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:19,025 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 3 equivalence classes. [2025-01-10 01:12:19,040 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 01:12:19,040 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:12:19,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:19,553 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:12:19,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:19,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905306251] [2025-01-10 01:12:19,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905306251] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:19,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300207002] [2025-01-10 01:12:19,553 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:12:19,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:19,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:19,556 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:19,567 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:19,603 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 3 equivalence classes. [2025-01-10 01:12:19,629 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 01:12:19,629 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:12:19,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:19,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-10 01:12:19,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:19,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-10 01:12:20,317 INFO L349 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2025-01-10 01:12:20,317 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 35 treesize of output 13 [2025-01-10 01:12:20,392 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:12:20,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:21,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 68 [2025-01-10 01:12:21,290 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-01-10 01:12:21,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 133 treesize of output 131 [2025-01-10 01:12:21,898 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:12:21,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300207002] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:12:21,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:12:21,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 46 [2025-01-10 01:12:21,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720728993] [2025-01-10 01:12:21,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:12:21,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-01-10 01:12:21,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:21,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-01-10 01:12:21,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2025-01-10 01:12:22,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2025-01-10 01:12:22,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 556 transitions, 5893 flow. Second operand has 47 states, 47 states have (on average 13.361702127659575) internal successors, (628), 47 states have internal predecessors, (628), 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:22,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:22,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2025-01-10 01:12:22,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:49,833 INFO L124 PetriNetUnfolderBase]: 30989/50440 cut-off events. [2025-01-10 01:12:49,833 INFO L125 PetriNetUnfolderBase]: For 745408/746385 co-relation queries the response was YES. [2025-01-10 01:12:50,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268080 conditions, 50440 events. 30989/50440 cut-off events. For 745408/746385 co-relation queries the response was YES. Maximal size of possible extension queue 1537. Compared 395450 event pairs, 3656 based on Foata normal form. 846/48664 useless extension candidates. Maximal degree in co-relation 266682. Up to 7912 conditions per place. [2025-01-10 01:12:51,158 INFO L140 encePairwiseOnDemand]: 28/46 looper letters, 1292 selfloop transitions, 1207 changer transitions 676/3181 dead transitions. [2025-01-10 01:12:51,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 3181 transitions, 36303 flow [2025-01-10 01:12:51,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 246 states. [2025-01-10 01:12:51,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2025-01-10 01:12:51,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 4685 transitions. [2025-01-10 01:12:51,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41401555319901023 [2025-01-10 01:12:51,179 INFO L175 Difference]: Start difference. First operand has 319 places, 556 transitions, 5893 flow. Second operand 246 states and 4685 transitions. [2025-01-10 01:12:51,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 524 places, 3181 transitions, 36303 flow [2025-01-10 01:12:57,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 496 places, 3181 transitions, 30716 flow, removed 2066 selfloop flow, removed 28 redundant places. [2025-01-10 01:12:57,356 INFO L231 Difference]: Finished difference. Result has 585 places, 1384 transitions, 17545 flow [2025-01-10 01:12:57,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4078, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=320, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=246, PETRI_FLOW=17545, PETRI_PLACES=585, PETRI_TRANSITIONS=1384} [2025-01-10 01:12:57,357 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 537 predicate places. [2025-01-10 01:12:57,357 INFO L471 AbstractCegarLoop]: Abstraction has has 585 places, 1384 transitions, 17545 flow [2025-01-10 01:12:57,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 13.361702127659575) internal successors, (628), 47 states have internal predecessors, (628), 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:57,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:57,358 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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] [2025-01-10 01:12:57,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 01:12:57,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-10 01:12:57,559 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-01-10 01:12:57,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:57,563 INFO L85 PathProgramCache]: Analyzing trace with hash 617752965, now seen corresponding path program 6 times [2025-01-10 01:12:57,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:57,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143694031] [2025-01-10 01:12:57,563 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:12:57,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:57,573 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 44 statements into 3 equivalence classes. [2025-01-10 01:12:57,625 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 01:12:57,625 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-10 01:12:57,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:58,319 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:12:58,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:58,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143694031] [2025-01-10 01:12:58,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143694031] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:58,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833559730] [2025-01-10 01:12:58,320 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:12:58,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:58,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:58,324 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:58,329 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:58,369 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 44 statements into 3 equivalence classes. [2025-01-10 01:12:58,393 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 01:12:58,393 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-10 01:12:58,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:58,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-10 01:12:58,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:58,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 01:12:59,008 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:12:59,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:59,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 68 [2025-01-10 01:12:59,869 INFO L349 Elim1Store]: treesize reduction 18, result has 60.0 percent of original size [2025-01-10 01:12:59,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 132 treesize of output 121 [2025-01-10 01:13:00,177 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:13:00,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833559730] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:00,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:00,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 41 [2025-01-10 01:13:00,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673764873] [2025-01-10 01:13:00,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:00,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-01-10 01:13:00,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:00,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-01-10 01:13:00,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=1464, Unknown=0, NotChecked=0, Total=1722 [2025-01-10 01:13:00,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2025-01-10 01:13:00,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 1384 transitions, 17545 flow. Second operand has 42 states, 42 states have (on average 16.261904761904763) internal successors, (683), 42 states have internal predecessors, (683), 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:00,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:00,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2025-01-10 01:13:00,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand