./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-simple-queue.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-simple-queue.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 608e0c2870f111f9f6921442a1f1a544ee956a8de04c7629c0edf3e54cde4da3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:13:02,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:13:02,743 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:13:02,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:13:02,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:13:02,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:13:02,772 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:13:02,772 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:13:02,773 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:13:02,773 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:13:02,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:13:02,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:13:02,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:13:02,774 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:13:02,775 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:13:02,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:13:02,775 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:13:02,775 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:13:02,775 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:13:02,775 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:13:02,775 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:13:02,776 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:13:02,776 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:13:02,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:13:02,776 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:13:02,776 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:13:02,776 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:13:02,776 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:13:02,776 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:13:02,777 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:13:02,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:13:02,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:13:02,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:13:02,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:13:02,778 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:13:02,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:13:02,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:13:02,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:13:02,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:13:02,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:13:02,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:13:02,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:13:02,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:13:02,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:13:02,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:13:02,779 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:13:02,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:13:02,779 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 -> 608e0c2870f111f9f6921442a1f1a544ee956a8de04c7629c0edf3e54cde4da3 [2025-01-10 01:13:03,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:13:03,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:13:03,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:13:03,060 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:13:03,060 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:13:03,061 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-simple-queue.wvr.c [2025-01-10 01:13:04,390 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc99697fb/910cad9fc65642e494c33ee24fff616e/FLAG04d028bdb [2025-01-10 01:13:04,637 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:13:04,637 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-simple-queue.wvr.c [2025-01-10 01:13:04,643 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc99697fb/910cad9fc65642e494c33ee24fff616e/FLAG04d028bdb [2025-01-10 01:13:04,654 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc99697fb/910cad9fc65642e494c33ee24fff616e [2025-01-10 01:13:04,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:13:04,657 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:13:04,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:13:04,660 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:13:04,663 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:13:04,663 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:13:04" (1/1) ... [2025-01-10 01:13:04,664 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f7a3495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:04, skipping insertion in model container [2025-01-10 01:13:04,664 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:13:04" (1/1) ... [2025-01-10 01:13:04,679 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:13:04,833 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:13:04,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:13:04,846 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:13:04,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:13:04,891 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:13:04,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:04 WrapperNode [2025-01-10 01:13:04,892 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:13:04,893 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:13:04,893 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:13:04,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:13:04,900 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:13:04" (1/1) ... [2025-01-10 01:13:04,906 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:13:04" (1/1) ... [2025-01-10 01:13:04,923 INFO L138 Inliner]: procedures = 23, calls = 24, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 122 [2025-01-10 01:13:04,924 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:13:04,924 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:13:04,924 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:13:04,925 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:13:04,931 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:04" (1/1) ... [2025-01-10 01:13:04,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:04" (1/1) ... [2025-01-10 01:13:04,934 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:04" (1/1) ... [2025-01-10 01:13:04,949 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:13:04,949 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:04" (1/1) ... [2025-01-10 01:13:04,950 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:04" (1/1) ... [2025-01-10 01:13:04,955 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:04" (1/1) ... [2025-01-10 01:13:04,956 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:04" (1/1) ... [2025-01-10 01:13:04,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:04" (1/1) ... [2025-01-10 01:13:04,961 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:04" (1/1) ... [2025-01-10 01:13:04,962 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:04" (1/1) ... [2025-01-10 01:13:04,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:13:04,964 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:13:04,964 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:13:04,964 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:13:04,965 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:04" (1/1) ... [2025-01-10 01:13:04,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:13:04,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:04,995 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:13:04,997 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:13:05,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:13:05,015 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:13:05,015 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:13:05,015 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:13:05,015 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:13:05,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:13:05,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:13:05,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:13:05,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:13:05,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 01:13:05,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 01:13:05,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:13:05,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:13:05,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:13:05,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:13:05,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:13:05,017 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:13:05,102 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:13:05,104 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:13:05,384 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:13:05,385 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:13:05,555 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:13:05,555 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 01:13:05,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:13:05 BoogieIcfgContainer [2025-01-10 01:13:05,556 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:13:05,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:13:05,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:13:05,562 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:13:05,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:13:04" (1/3) ... [2025-01-10 01:13:05,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa907ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:13:05, skipping insertion in model container [2025-01-10 01:13:05,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:04" (2/3) ... [2025-01-10 01:13:05,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa907ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:13:05, skipping insertion in model container [2025-01-10 01:13:05,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:13:05" (3/3) ... [2025-01-10 01:13:05,568 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-simple-queue.wvr.c [2025-01-10 01:13:05,581 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:13:05,583 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-simple-queue.wvr.c that has 3 procedures, 33 locations, 1 initial locations, 3 loop locations, and 8 error locations. [2025-01-10 01:13:05,583 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:13:05,643 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 01:13:05,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 37 transitions, 88 flow [2025-01-10 01:13:05,710 INFO L124 PetriNetUnfolderBase]: 5/35 cut-off events. [2025-01-10 01:13:05,715 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:13:05,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 35 events. 5/35 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 49 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-01-10 01:13:05,720 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 37 transitions, 88 flow [2025-01-10 01:13:05,723 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 34 transitions, 80 flow [2025-01-10 01:13:05,733 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:13:05,744 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;@25b1d172, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:13:05,744 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-01-10 01:13:05,750 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:13:05,750 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:13:05,751 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:13:05,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:05,751 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:13:05,752 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:05,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:05,756 INFO L85 PathProgramCache]: Analyzing trace with hash 397253, now seen corresponding path program 1 times [2025-01-10 01:13:05,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:05,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777763580] [2025-01-10 01:13:05,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:05,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:05,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:13:05,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:13:05,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:05,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:06,019 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:13:06,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:06,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777763580] [2025-01-10 01:13:06,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777763580] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:06,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:06,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:13:06,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410988497] [2025-01-10 01:13:06,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:06,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:13:06,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:06,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:13:06,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:13:06,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-01-10 01:13:06,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:06,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:06,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-01-10 01:13:06,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:06,229 INFO L124 PetriNetUnfolderBase]: 212/371 cut-off events. [2025-01-10 01:13:06,230 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-01-10 01:13:06,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 371 events. 212/371 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1449 event pairs, 176 based on Foata normal form. 1/264 useless extension candidates. Maximal degree in co-relation 705. Up to 364 conditions per place. [2025-01-10 01:13:06,235 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 23 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2025-01-10 01:13:06,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 120 flow [2025-01-10 01:13:06,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:13:06,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:13:06,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-01-10 01:13:06,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45045045045045046 [2025-01-10 01:13:06,247 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 80 flow. Second operand 3 states and 50 transitions. [2025-01-10 01:13:06,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 120 flow [2025-01-10 01:13:06,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 112 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:13:06,254 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 66 flow [2025-01-10 01:13:06,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2025-01-10 01:13:06,258 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2025-01-10 01:13:06,259 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 66 flow [2025-01-10 01:13:06,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:06,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:06,259 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:13:06,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:13:06,260 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:06,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:06,260 INFO L85 PathProgramCache]: Analyzing trace with hash 397254, now seen corresponding path program 1 times [2025-01-10 01:13:06,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:06,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168213108] [2025-01-10 01:13:06,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:06,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:06,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:13:06,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:13:06,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:06,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:06,560 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:13:06,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:06,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168213108] [2025-01-10 01:13:06,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168213108] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:06,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:06,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:13:06,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643643176] [2025-01-10 01:13:06,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:06,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:13:06,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:06,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:13:06,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:13:06,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-01-10 01:13:06,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:06,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:06,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-01-10 01:13:06,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:06,774 INFO L124 PetriNetUnfolderBase]: 213/374 cut-off events. [2025-01-10 01:13:06,774 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 01:13:06,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 374 events. 213/374 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1453 event pairs, 176 based on Foata normal form. 0/266 useless extension candidates. Maximal degree in co-relation 737. Up to 369 conditions per place. [2025-01-10 01:13:06,778 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 25 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2025-01-10 01:13:06,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 132 flow [2025-01-10 01:13:06,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:13:06,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:13:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2025-01-10 01:13:06,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3918918918918919 [2025-01-10 01:13:06,781 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 66 flow. Second operand 4 states and 58 transitions. [2025-01-10 01:13:06,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 132 flow [2025-01-10 01:13:06,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:06,783 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 89 flow [2025-01-10 01:13:06,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2025-01-10 01:13:06,783 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2025-01-10 01:13:06,783 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 89 flow [2025-01-10 01:13:06,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:06,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:06,785 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:13:06,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:13:06,785 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:06,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:06,786 INFO L85 PathProgramCache]: Analyzing trace with hash 381772987, now seen corresponding path program 1 times [2025-01-10 01:13:06,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:06,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792182119] [2025-01-10 01:13:06,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:06,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:06,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:13:06,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:13:06,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:06,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:07,088 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:13:07,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:07,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792182119] [2025-01-10 01:13:07,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792182119] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:07,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804952726] [2025-01-10 01:13:07,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:07,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:07,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:07,093 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:13:07,095 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:13:07,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:13:07,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:13:07,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:07,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:07,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:13:07,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:07,224 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:13:07,448 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:13:07,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:07,560 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:13:07,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804952726] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:07,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:07,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:13:07,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438143581] [2025-01-10 01:13:07,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:07,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:13:07,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:07,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:13:07,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:13:07,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-01-10 01:13:07,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 89 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:07,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:07,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-01-10 01:13:07,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:07,881 INFO L124 PetriNetUnfolderBase]: 214/376 cut-off events. [2025-01-10 01:13:07,881 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 01:13:07,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 376 events. 214/376 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1469 event pairs, 176 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 744. Up to 366 conditions per place. [2025-01-10 01:13:07,884 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 21 selfloop transitions, 10 changer transitions 0/34 dead transitions. [2025-01-10 01:13:07,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 159 flow [2025-01-10 01:13:07,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:13:07,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:13:07,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2025-01-10 01:13:07,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30067567567567566 [2025-01-10 01:13:07,889 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 89 flow. Second operand 8 states and 89 transitions. [2025-01-10 01:13:07,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 159 flow [2025-01-10 01:13:07,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 34 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:13:07,892 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 114 flow [2025-01-10 01:13:07,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=114, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2025-01-10 01:13:07,893 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2025-01-10 01:13:07,893 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 114 flow [2025-01-10 01:13:07,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:07,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:07,894 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:07,903 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:13:08,098 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:13:08,098 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:08,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:08,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1873643918, now seen corresponding path program 1 times [2025-01-10 01:13:08,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:08,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854379226] [2025-01-10 01:13:08,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:08,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:08,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:13:08,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:13:08,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:08,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:08,158 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:13:08,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:08,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854379226] [2025-01-10 01:13:08,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854379226] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:08,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:08,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:13:08,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218481442] [2025-01-10 01:13:08,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:08,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:13:08,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:08,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:13:08,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:13:08,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-10 01:13:08,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:08,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:08,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-10 01:13:08,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:08,288 INFO L124 PetriNetUnfolderBase]: 281/515 cut-off events. [2025-01-10 01:13:08,288 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-10 01:13:08,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1063 conditions, 515 events. 281/515 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2248 event pairs, 244 based on Foata normal form. 23/406 useless extension candidates. Maximal degree in co-relation 745. Up to 370 conditions per place. [2025-01-10 01:13:08,292 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 41 selfloop transitions, 3 changer transitions 2/49 dead transitions. [2025-01-10 01:13:08,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 240 flow [2025-01-10 01:13:08,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:13:08,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:13:08,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2025-01-10 01:13:08,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5472972972972973 [2025-01-10 01:13:08,295 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 114 flow. Second operand 4 states and 81 transitions. [2025-01-10 01:13:08,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 240 flow [2025-01-10 01:13:08,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 49 transitions, 198 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-01-10 01:13:08,299 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 91 flow [2025-01-10 01:13:08,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=91, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2025-01-10 01:13:08,300 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2025-01-10 01:13:08,300 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 91 flow [2025-01-10 01:13:08,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:08,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:08,300 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:08,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:13:08,301 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:08,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:08,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1578851331, now seen corresponding path program 1 times [2025-01-10 01:13:08,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:08,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230631516] [2025-01-10 01:13:08,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:08,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:08,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:13:08,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:13:08,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:08,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:08,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:08,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:08,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230631516] [2025-01-10 01:13:08,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230631516] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:08,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334976414] [2025-01-10 01:13:08,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:08,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:08,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:08,511 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:13:08,513 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:13:08,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:13:08,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:13:08,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:08,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:08,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 01:13:08,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:08,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 01:13:08,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:08,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:13:08,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334976414] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:08,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:13:08,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2025-01-10 01:13:08,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490727482] [2025-01-10 01:13:08,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:08,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:13:08,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:08,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:13:08,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:13:08,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-10 01:13:08,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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:08,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:08,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-10 01:13:08,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:08,796 INFO L124 PetriNetUnfolderBase]: 233/434 cut-off events. [2025-01-10 01:13:08,797 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-10 01:13:08,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 434 events. 233/434 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1824 event pairs, 200 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 648. Up to 419 conditions per place. [2025-01-10 01:13:08,799 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 25 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2025-01-10 01:13:08,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 141 flow [2025-01-10 01:13:08,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:13:08,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:13:08,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-01-10 01:13:08,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38513513513513514 [2025-01-10 01:13:08,800 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 91 flow. Second operand 4 states and 57 transitions. [2025-01-10 01:13:08,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 141 flow [2025-01-10 01:13:08,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:08,802 INFO L231 Difference]: Finished difference. Result has 35 places, 32 transitions, 86 flow [2025-01-10 01:13:08,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=35, PETRI_TRANSITIONS=32} [2025-01-10 01:13:08,802 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2025-01-10 01:13:08,803 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 32 transitions, 86 flow [2025-01-10 01:13:08,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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:08,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:08,803 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:08,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:13:09,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:09,004 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:09,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:09,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1578851330, now seen corresponding path program 1 times [2025-01-10 01:13:09,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:09,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349692059] [2025-01-10 01:13:09,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:09,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:09,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:13:09,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:13:09,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:09,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:09,046 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:13:09,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:09,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349692059] [2025-01-10 01:13:09,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349692059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:09,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:09,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:13:09,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029036827] [2025-01-10 01:13:09,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:09,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:13:09,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:09,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:13:09,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:13:09,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-01-10 01:13:09,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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:09,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:09,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-01-10 01:13:09,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:09,124 INFO L124 PetriNetUnfolderBase]: 191/363 cut-off events. [2025-01-10 01:13:09,124 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-10 01:13:09,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 363 events. 191/363 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1475 event pairs, 162 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 458. Up to 348 conditions per place. [2025-01-10 01:13:09,126 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 23 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2025-01-10 01:13:09,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 30 transitions, 132 flow [2025-01-10 01:13:09,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:13:09,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:13:09,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2025-01-10 01:13:09,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34459459459459457 [2025-01-10 01:13:09,128 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 86 flow. Second operand 4 states and 51 transitions. [2025-01-10 01:13:09,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 30 transitions, 132 flow [2025-01-10 01:13:09,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 127 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:09,130 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 81 flow [2025-01-10 01:13:09,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=81, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2025-01-10 01:13:09,131 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2025-01-10 01:13:09,132 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 81 flow [2025-01-10 01:13:09,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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:09,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:09,132 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:09,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:13:09,132 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:09,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:09,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1928695835, now seen corresponding path program 1 times [2025-01-10 01:13:09,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:09,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207686726] [2025-01-10 01:13:09,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:09,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:09,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:13:09,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:13:09,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:09,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:09,167 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:13:09,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:09,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207686726] [2025-01-10 01:13:09,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207686726] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:09,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:09,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:13:09,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229808025] [2025-01-10 01:13:09,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:09,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:13:09,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:09,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:13:09,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:13:09,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-10 01:13:09,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:09,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:09,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-10 01:13:09,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:09,252 INFO L124 PetriNetUnfolderBase]: 272/497 cut-off events. [2025-01-10 01:13:09,252 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-01-10 01:13:09,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1060 conditions, 497 events. 272/497 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2023 event pairs, 150 based on Foata normal form. 2/422 useless extension candidates. Maximal degree in co-relation 751. Up to 315 conditions per place. [2025-01-10 01:13:09,254 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 34 selfloop transitions, 2 changer transitions 4/43 dead transitions. [2025-01-10 01:13:09,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 43 transitions, 193 flow [2025-01-10 01:13:09,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:13:09,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:13:09,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-01-10 01:13:09,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5315315315315315 [2025-01-10 01:13:09,256 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 81 flow. Second operand 3 states and 59 transitions. [2025-01-10 01:13:09,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 43 transitions, 193 flow [2025-01-10 01:13:09,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 43 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:09,257 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 84 flow [2025-01-10 01:13:09,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2025-01-10 01:13:09,258 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2025-01-10 01:13:09,258 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 84 flow [2025-01-10 01:13:09,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:09,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:09,258 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:09,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:13:09,258 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:09,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:09,259 INFO L85 PathProgramCache]: Analyzing trace with hash 717068353, now seen corresponding path program 1 times [2025-01-10 01:13:09,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:09,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113231668] [2025-01-10 01:13:09,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:09,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:09,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:13:09,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:13:09,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:09,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:09,329 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:13:09,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:09,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113231668] [2025-01-10 01:13:09,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113231668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:09,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:09,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:13:09,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911062145] [2025-01-10 01:13:09,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:09,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:13:09,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:09,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:13:09,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:13:09,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-10 01:13:09,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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:09,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:09,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-10 01:13:09,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:09,420 INFO L124 PetriNetUnfolderBase]: 252/452 cut-off events. [2025-01-10 01:13:09,420 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-01-10 01:13:09,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1011 conditions, 452 events. 252/452 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1656 event pairs, 113 based on Foata normal form. 11/391 useless extension candidates. Maximal degree in co-relation 983. Up to 306 conditions per place. [2025-01-10 01:13:09,424 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 33 selfloop transitions, 2 changer transitions 6/44 dead transitions. [2025-01-10 01:13:09,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 44 transitions, 199 flow [2025-01-10 01:13:09,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:13:09,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:13:09,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-01-10 01:13:09,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5405405405405406 [2025-01-10 01:13:09,425 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 84 flow. Second operand 3 states and 60 transitions. [2025-01-10 01:13:09,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 44 transitions, 199 flow [2025-01-10 01:13:09,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 197 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:13:09,429 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 96 flow [2025-01-10 01:13:09,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2025-01-10 01:13:09,430 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2025-01-10 01:13:09,431 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 96 flow [2025-01-10 01:13:09,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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:09,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:09,431 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:09,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:13:09,431 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:09,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:09,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1266084141, now seen corresponding path program 1 times [2025-01-10 01:13:09,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:09,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943354415] [2025-01-10 01:13:09,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:09,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:09,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:13:09,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:13:09,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:09,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:09,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:13:09,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:09,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943354415] [2025-01-10 01:13:09,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943354415] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:09,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876806395] [2025-01-10 01:13:09,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:09,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:09,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:09,785 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:13:09,791 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:13:09,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:13:09,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:13:09,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:09,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:09,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 01:13:09,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:09,900 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:13:10,051 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:13:10,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:10,466 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 38 treesize of output 34 [2025-01-10 01:13:10,485 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 01:13:10,486 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 46 treesize of output 37 [2025-01-10 01:13:10,558 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:13:10,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876806395] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:10,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:10,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-01-10 01:13:10,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492734394] [2025-01-10 01:13:10,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:10,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 01:13:10,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:10,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 01:13:10,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:13:10,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-10 01:13:10,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 96 flow. Second operand has 15 states, 15 states have (on average 11.8) internal successors, (177), 15 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:10,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:10,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-10 01:13:10,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:11,426 INFO L124 PetriNetUnfolderBase]: 1151/2034 cut-off events. [2025-01-10 01:13:11,426 INFO L125 PetriNetUnfolderBase]: For 604/604 co-relation queries the response was YES. [2025-01-10 01:13:11,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4720 conditions, 2034 events. 1151/2034 cut-off events. For 604/604 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 10586 event pairs, 387 based on Foata normal form. 5/1724 useless extension candidates. Maximal degree in co-relation 2339. Up to 451 conditions per place. [2025-01-10 01:13:11,438 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 112 selfloop transitions, 22 changer transitions 30/167 dead transitions. [2025-01-10 01:13:11,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 167 transitions, 807 flow [2025-01-10 01:13:11,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 01:13:11,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 01:13:11,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 277 transitions. [2025-01-10 01:13:11,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5347490347490348 [2025-01-10 01:13:11,440 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 96 flow. Second operand 14 states and 277 transitions. [2025-01-10 01:13:11,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 167 transitions, 807 flow [2025-01-10 01:13:11,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 167 transitions, 794 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-01-10 01:13:11,444 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 281 flow [2025-01-10 01:13:11,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=281, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2025-01-10 01:13:11,444 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2025-01-10 01:13:11,444 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 281 flow [2025-01-10 01:13:11,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.8) internal successors, (177), 15 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:11,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:11,445 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:11,452 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:13:11,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:11,649 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:11,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:11,650 INFO L85 PathProgramCache]: Analyzing trace with hash 472514549, now seen corresponding path program 2 times [2025-01-10 01:13:11,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:11,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098956423] [2025-01-10 01:13:11,650 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:13:11,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:11,660 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-10 01:13:11,669 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:13:11,669 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:13:11,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:11,738 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:13:11,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:11,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098956423] [2025-01-10 01:13:11,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098956423] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:11,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:11,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:13:11,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449960042] [2025-01-10 01:13:11,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:11,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:13:11,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:11,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:13:11,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:13:11,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-10 01:13:11,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 281 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:11,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:11,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-10 01:13:11,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:12,078 INFO L124 PetriNetUnfolderBase]: 1868/3289 cut-off events. [2025-01-10 01:13:12,078 INFO L125 PetriNetUnfolderBase]: For 3911/3911 co-relation queries the response was YES. [2025-01-10 01:13:12,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8472 conditions, 3289 events. 1868/3289 cut-off events. For 3911/3911 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 18584 event pairs, 724 based on Foata normal form. 33/2807 useless extension candidates. Maximal degree in co-relation 7571. Up to 1489 conditions per place. [2025-01-10 01:13:12,094 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 68 selfloop transitions, 14 changer transitions 0/85 dead transitions. [2025-01-10 01:13:12,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 85 transitions, 626 flow [2025-01-10 01:13:12,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:13:12,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:13:12,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-01-10 01:13:12,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5743243243243243 [2025-01-10 01:13:12,095 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 281 flow. Second operand 4 states and 85 transitions. [2025-01-10 01:13:12,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 85 transitions, 626 flow [2025-01-10 01:13:12,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 85 transitions, 595 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:12,104 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 421 flow [2025-01-10 01:13:12,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=421, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2025-01-10 01:13:12,104 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2025-01-10 01:13:12,105 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 421 flow [2025-01-10 01:13:12,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:12,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:12,105 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:12,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:13:12,105 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:12,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:12,106 INFO L85 PathProgramCache]: Analyzing trace with hash -2112299040, now seen corresponding path program 3 times [2025-01-10 01:13:12,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:12,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84934902] [2025-01-10 01:13:12,106 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:13:12,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:12,117 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 6 equivalence classes. [2025-01-10 01:13:12,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 32 statements. [2025-01-10 01:13:12,131 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:13:12,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:12,214 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-10 01:13:12,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:12,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84934902] [2025-01-10 01:13:12,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84934902] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:12,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:12,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:13:12,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437172382] [2025-01-10 01:13:12,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:12,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:13:12,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:12,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:13:12,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:13:12,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-10 01:13:12,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 421 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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:12,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:12,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-10 01:13:12,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:12,625 INFO L124 PetriNetUnfolderBase]: 2326/4083 cut-off events. [2025-01-10 01:13:12,626 INFO L125 PetriNetUnfolderBase]: For 7442/7442 co-relation queries the response was YES. [2025-01-10 01:13:12,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11173 conditions, 4083 events. 2326/4083 cut-off events. For 7442/7442 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 23846 event pairs, 580 based on Foata normal form. 3/3444 useless extension candidates. Maximal degree in co-relation 9112. Up to 1316 conditions per place. [2025-01-10 01:13:12,646 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 68 selfloop transitions, 18 changer transitions 12/101 dead transitions. [2025-01-10 01:13:12,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 101 transitions, 818 flow [2025-01-10 01:13:12,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:13:12,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:13:12,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2025-01-10 01:13:12,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5513513513513514 [2025-01-10 01:13:12,648 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 421 flow. Second operand 5 states and 102 transitions. [2025-01-10 01:13:12,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 101 transitions, 818 flow [2025-01-10 01:13:12,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 101 transitions, 770 flow, removed 24 selfloop flow, removed 0 redundant places. [2025-01-10 01:13:12,664 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 498 flow [2025-01-10 01:13:12,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=498, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2025-01-10 01:13:12,665 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 27 predicate places. [2025-01-10 01:13:12,665 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 498 flow [2025-01-10 01:13:12,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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:12,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:12,666 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:12,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:13:12,666 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:12,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:12,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1137179833, now seen corresponding path program 4 times [2025-01-10 01:13:12,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:12,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131093108] [2025-01-10 01:13:12,667 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:13:12,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:12,674 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-01-10 01:13:12,691 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:13:12,692 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:13:12,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:12,858 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:13:12,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:12,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131093108] [2025-01-10 01:13:12,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131093108] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:12,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501329205] [2025-01-10 01:13:12,858 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:13:12,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:12,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:12,861 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:13:12,863 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:13:12,912 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-01-10 01:13:12,941 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:13:12,941 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:13:12,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:12,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-10 01:13:12,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:12,996 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:13:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:13:13,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:13,831 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 38 treesize of output 34 [2025-01-10 01:13:13,844 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 01:13:13,845 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 46 treesize of output 37 [2025-01-10 01:13:13,929 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:13:13,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501329205] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:13,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:13,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2025-01-10 01:13:13,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194879076] [2025-01-10 01:13:13,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:13,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 01:13:13,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:13,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 01:13:13,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:13:13,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-10 01:13:13,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 498 flow. Second operand has 19 states, 19 states have (on average 12.052631578947368) internal successors, (229), 19 states have internal predecessors, (229), 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:13,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:13,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-10 01:13:13,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:15,425 INFO L124 PetriNetUnfolderBase]: 3341/5896 cut-off events. [2025-01-10 01:13:15,426 INFO L125 PetriNetUnfolderBase]: For 11959/11959 co-relation queries the response was YES. [2025-01-10 01:13:15,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15868 conditions, 5896 events. 3341/5896 cut-off events. For 11959/11959 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 36331 event pairs, 607 based on Foata normal form. 112/5077 useless extension candidates. Maximal degree in co-relation 13859. Up to 1075 conditions per place. [2025-01-10 01:13:15,455 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 63 selfloop transitions, 25 changer transitions 134/225 dead transitions. [2025-01-10 01:13:15,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 225 transitions, 1523 flow [2025-01-10 01:13:15,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 01:13:15,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-10 01:13:15,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 347 transitions. [2025-01-10 01:13:15,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.521021021021021 [2025-01-10 01:13:15,457 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 498 flow. Second operand 18 states and 347 transitions. [2025-01-10 01:13:15,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 225 transitions, 1523 flow [2025-01-10 01:13:15,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 225 transitions, 1453 flow, removed 20 selfloop flow, removed 5 redundant places. [2025-01-10 01:13:15,480 INFO L231 Difference]: Finished difference. Result has 82 places, 50 transitions, 474 flow [2025-01-10 01:13:15,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=474, PETRI_PLACES=82, PETRI_TRANSITIONS=50} [2025-01-10 01:13:15,483 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 46 predicate places. [2025-01-10 01:13:15,484 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 50 transitions, 474 flow [2025-01-10 01:13:15,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.052631578947368) internal successors, (229), 19 states have internal predecessors, (229), 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:15,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:15,484 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:15,492 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:13:15,685 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:13:15,685 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:15,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:15,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1353975445, now seen corresponding path program 5 times [2025-01-10 01:13:15,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:15,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761768469] [2025-01-10 01:13:15,686 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:13:15,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:15,699 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 5 equivalence classes. [2025-01-10 01:13:15,726 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 01:13:15,726 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-01-10 01:13:15,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:15,836 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:13:15,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:15,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761768469] [2025-01-10 01:13:15,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761768469] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:15,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860192909] [2025-01-10 01:13:15,837 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:13:15,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:15,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:15,839 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:13:15,842 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:13:15,895 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 5 equivalence classes. [2025-01-10 01:13:15,931 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 01:13:15,931 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-01-10 01:13:15,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:15,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:13:15,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:15,992 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:13:15,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:16,177 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:13:16,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860192909] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:16,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:16,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 6] total 9 [2025-01-10 01:13:16,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133502037] [2025-01-10 01:13:16,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:16,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:13:16,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:16,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:13:16,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:13:16,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-10 01:13:16,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 50 transitions, 474 flow. Second operand has 10 states, 10 states have (on average 13.7) internal successors, (137), 10 states have internal predecessors, (137), 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:16,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:16,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-10 01:13:16,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:16,738 INFO L124 PetriNetUnfolderBase]: 2966/5143 cut-off events. [2025-01-10 01:13:16,738 INFO L125 PetriNetUnfolderBase]: For 17659/17659 co-relation queries the response was YES. [2025-01-10 01:13:16,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15516 conditions, 5143 events. 2966/5143 cut-off events. For 17659/17659 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 29581 event pairs, 774 based on Foata normal form. 22/4366 useless extension candidates. Maximal degree in co-relation 11284. Up to 1506 conditions per place. [2025-01-10 01:13:16,767 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 79 selfloop transitions, 28 changer transitions 0/110 dead transitions. [2025-01-10 01:13:16,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 110 transitions, 1165 flow [2025-01-10 01:13:16,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:13:16,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:13:16,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-01-10 01:13:16,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5891891891891892 [2025-01-10 01:13:16,768 INFO L175 Difference]: Start difference. First operand has 82 places, 50 transitions, 474 flow. Second operand 5 states and 109 transitions. [2025-01-10 01:13:16,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 110 transitions, 1165 flow [2025-01-10 01:13:16,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 110 transitions, 919 flow, removed 99 selfloop flow, removed 12 redundant places. [2025-01-10 01:13:16,795 INFO L231 Difference]: Finished difference. Result has 64 places, 68 transitions, 655 flow [2025-01-10 01:13:16,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=655, PETRI_PLACES=64, PETRI_TRANSITIONS=68} [2025-01-10 01:13:16,797 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 28 predicate places. [2025-01-10 01:13:16,797 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 68 transitions, 655 flow [2025-01-10 01:13:16,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.7) internal successors, (137), 10 states have internal predecessors, (137), 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:16,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:16,798 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:16,805 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:13:16,998 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:13:16,998 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:17,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:17,000 INFO L85 PathProgramCache]: Analyzing trace with hash 458527829, now seen corresponding path program 6 times [2025-01-10 01:13:17,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:17,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480648766] [2025-01-10 01:13:17,000 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:13:17,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:17,011 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 5 equivalence classes. [2025-01-10 01:13:17,046 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 34 of 42 statements. [2025-01-10 01:13:17,046 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-01-10 01:13:17,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:17,450 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:13:17,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:17,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480648766] [2025-01-10 01:13:17,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480648766] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:17,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911307042] [2025-01-10 01:13:17,451 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:13:17,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:17,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:17,453 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:13:17,456 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:13:17,505 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 5 equivalence classes. [2025-01-10 01:13:17,662 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 34 of 42 statements. [2025-01-10 01:13:17,663 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-01-10 01:13:17,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:17,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-10 01:13:17,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:17,961 INFO L349 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2025-01-10 01:13:17,961 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:13:17,974 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:13:17,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:18,226 INFO L349 Elim1Store]: treesize reduction 10, result has 47.4 percent of original size [2025-01-10 01:13:18,227 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 37 treesize of output 20 [2025-01-10 01:13:18,362 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:13:18,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911307042] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:18,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:18,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2025-01-10 01:13:18,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542229193] [2025-01-10 01:13:18,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:18,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-10 01:13:18,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:18,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-10 01:13:18,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2025-01-10 01:13:18,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-10 01:13:18,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 68 transitions, 655 flow. Second operand has 25 states, 25 states have (on average 11.0) internal successors, (275), 25 states have internal predecessors, (275), 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:18,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:18,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-10 01:13:18,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:19,919 INFO L124 PetriNetUnfolderBase]: 4842/8368 cut-off events. [2025-01-10 01:13:19,919 INFO L125 PetriNetUnfolderBase]: For 14159/14159 co-relation queries the response was YES. [2025-01-10 01:13:19,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22956 conditions, 8368 events. 4842/8368 cut-off events. For 14159/14159 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 53465 event pairs, 1481 based on Foata normal form. 4/7072 useless extension candidates. Maximal degree in co-relation 13489. Up to 2986 conditions per place. [2025-01-10 01:13:19,963 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 123 selfloop transitions, 17 changer transitions 77/220 dead transitions. [2025-01-10 01:13:19,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 220 transitions, 1836 flow [2025-01-10 01:13:19,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 01:13:19,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-10 01:13:19,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 286 transitions. [2025-01-10 01:13:19,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4831081081081081 [2025-01-10 01:13:19,965 INFO L175 Difference]: Start difference. First operand has 64 places, 68 transitions, 655 flow. Second operand 16 states and 286 transitions. [2025-01-10 01:13:19,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 220 transitions, 1836 flow [2025-01-10 01:13:19,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 220 transitions, 1718 flow, removed 59 selfloop flow, removed 0 redundant places. [2025-01-10 01:13:20,000 INFO L231 Difference]: Finished difference. Result has 85 places, 65 transitions, 606 flow [2025-01-10 01:13:20,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=606, PETRI_PLACES=85, PETRI_TRANSITIONS=65} [2025-01-10 01:13:20,002 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 49 predicate places. [2025-01-10 01:13:20,002 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 65 transitions, 606 flow [2025-01-10 01:13:20,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 11.0) internal successors, (275), 25 states have internal predecessors, (275), 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:20,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:20,003 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:20,010 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:13:20,206 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:13:20,206 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:20,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:20,207 INFO L85 PathProgramCache]: Analyzing trace with hash -34030809, now seen corresponding path program 7 times [2025-01-10 01:13:20,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:20,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736199111] [2025-01-10 01:13:20,207 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:13:20,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:20,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 01:13:20,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 01:13:20,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:20,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:20,913 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:13:20,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:20,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736199111] [2025-01-10 01:13:20,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736199111] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:20,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338131627] [2025-01-10 01:13:20,914 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:13:20,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:20,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:20,916 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:13:20,918 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:13:20,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 01:13:20,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 01:13:20,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:20,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:21,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-10 01:13:21,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:21,459 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 01:13:21,460 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 23 treesize of output 10 [2025-01-10 01:13:21,467 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:13:21,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:21,577 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-01-10 01:13:21,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2025-01-10 01:13:22,128 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:13:22,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338131627] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:22,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:22,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2025-01-10 01:13:22,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297887907] [2025-01-10 01:13:22,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:22,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-10 01:13:22,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:22,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-10 01:13:22,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=923, Unknown=0, NotChecked=0, Total=1056 [2025-01-10 01:13:22,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-10 01:13:22,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 65 transitions, 606 flow. Second operand has 33 states, 33 states have (on average 11.242424242424242) internal successors, (371), 33 states have internal predecessors, (371), 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:22,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:22,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-10 01:13:22,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:23,973 INFO L124 PetriNetUnfolderBase]: 3247/5713 cut-off events. [2025-01-10 01:13:23,973 INFO L125 PetriNetUnfolderBase]: For 9499/9499 co-relation queries the response was YES. [2025-01-10 01:13:23,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15243 conditions, 5713 events. 3247/5713 cut-off events. For 9499/9499 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 33116 event pairs, 1083 based on Foata normal form. 14/4826 useless extension candidates. Maximal degree in co-relation 15121. Up to 2986 conditions per place. [2025-01-10 01:13:24,002 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 160 selfloop transitions, 21 changer transitions 97/281 dead transitions. [2025-01-10 01:13:24,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 281 transitions, 1863 flow [2025-01-10 01:13:24,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 01:13:24,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-01-10 01:13:24,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 448 transitions. [2025-01-10 01:13:24,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5045045045045045 [2025-01-10 01:13:24,006 INFO L175 Difference]: Start difference. First operand has 85 places, 65 transitions, 606 flow. Second operand 24 states and 448 transitions. [2025-01-10 01:13:24,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 281 transitions, 1863 flow [2025-01-10 01:13:24,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 281 transitions, 1812 flow, removed 16 selfloop flow, removed 8 redundant places. [2025-01-10 01:13:24,035 INFO L231 Difference]: Finished difference. Result has 108 places, 69 transitions, 690 flow [2025-01-10 01:13:24,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=690, PETRI_PLACES=108, PETRI_TRANSITIONS=69} [2025-01-10 01:13:24,036 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 72 predicate places. [2025-01-10 01:13:24,036 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 69 transitions, 690 flow [2025-01-10 01:13:24,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 11.242424242424242) internal successors, (371), 33 states have internal predecessors, (371), 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:24,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:24,037 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:24,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 01:13:24,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:24,241 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-10 01:13:24,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:24,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1955459426, now seen corresponding path program 8 times [2025-01-10 01:13:24,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:24,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151140927] [2025-01-10 01:13:24,242 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:13:24,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:24,249 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-01-10 01:13:24,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 01:13:24,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:13:24,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:24,511 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-10 01:13:24,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:24,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151140927] [2025-01-10 01:13:24,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151140927] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:24,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397678810] [2025-01-10 01:13:24,512 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:13:24,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:24,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:24,514 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:13:24,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 01:13:24,568 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-01-10 01:13:24,598 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 01:13:24,598 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:13:24,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:24,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 01:13:24,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:24,768 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-10 01:13:24,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:24,936 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 01:13:24,937 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 24 treesize of output 11 [2025-01-10 01:13:25,057 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-10 01:13:25,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397678810] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:25,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:25,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-01-10 01:13:25,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860479042] [2025-01-10 01:13:25,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:25,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:13:25,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:25,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:13:25,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:13:25,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-10 01:13:25,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 69 transitions, 690 flow. Second operand has 18 states, 18 states have (on average 12.277777777777779) internal successors, (221), 18 states have internal predecessors, (221), 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:25,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:25,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-10 01:13:25,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:25,819 INFO L124 PetriNetUnfolderBase]: 4300/7498 cut-off events. [2025-01-10 01:13:25,820 INFO L125 PetriNetUnfolderBase]: For 27562/27562 co-relation queries the response was YES. [2025-01-10 01:13:25,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21965 conditions, 7498 events. 4300/7498 cut-off events. For 27562/27562 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 45237 event pairs, 1132 based on Foata normal form. 34/6351 useless extension candidates. Maximal degree in co-relation 21931. Up to 2101 conditions per place. [2025-01-10 01:13:25,841 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 0 selfloop transitions, 0 changer transitions 150/150 dead transitions. [2025-01-10 01:13:25,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 150 transitions, 1443 flow [2025-01-10 01:13:25,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:13:25,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:13:25,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2025-01-10 01:13:25,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.543918918918919 [2025-01-10 01:13:25,842 INFO L175 Difference]: Start difference. First operand has 108 places, 69 transitions, 690 flow. Second operand 8 states and 161 transitions. [2025-01-10 01:13:25,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 150 transitions, 1443 flow [2025-01-10 01:13:25,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 150 transitions, 1224 flow, removed 58 selfloop flow, removed 21 redundant places. [2025-01-10 01:13:25,884 INFO L231 Difference]: Finished difference. Result has 87 places, 0 transitions, 0 flow [2025-01-10 01:13:25,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=87, PETRI_TRANSITIONS=0} [2025-01-10 01:13:25,885 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 51 predicate places. [2025-01-10 01:13:25,885 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 0 transitions, 0 flow [2025-01-10 01:13:25,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 12.277777777777779) internal successors, (221), 18 states have internal predecessors, (221), 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:25,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 14 remaining) [2025-01-10 01:13:25,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2025-01-10 01:13:25,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2025-01-10 01:13:25,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2025-01-10 01:13:25,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2025-01-10 01:13:25,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2025-01-10 01:13:25,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (7 of 14 remaining) [2025-01-10 01:13:25,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (6 of 14 remaining) [2025-01-10 01:13:25,890 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 14 remaining) [2025-01-10 01:13:25,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 14 remaining) [2025-01-10 01:13:25,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2025-01-10 01:13:25,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2025-01-10 01:13:25,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2025-01-10 01:13:25,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 14 remaining) [2025-01-10 01:13:25,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 01:13:26,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-10 01:13:26,096 INFO L422 BasicCegarLoop]: Path program histogram: [8, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:26,101 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 01:13:26,101 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:13:26,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:13:26 BasicIcfg [2025-01-10 01:13:26,106 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:13:26,106 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:13:26,106 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:13:26,107 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:13:26,107 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:13:05" (3/4) ... [2025-01-10 01:13:26,111 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:13:26,114 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-10 01:13:26,114 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-10 01:13:26,121 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 79 nodes and edges [2025-01-10 01:13:26,121 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-01-10 01:13:26,121 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-01-10 01:13:26,122 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-10 01:13:26,198 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:13:26,198 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:13:26,199 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:13:26,200 INFO L158 Benchmark]: Toolchain (without parser) took 21541.87ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 113.5MB in the beginning and 320.0MB in the end (delta: -206.5MB). Peak memory consumption was 251.6MB. Max. memory is 16.1GB. [2025-01-10 01:13:26,201 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 122.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:13:26,201 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.88ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 101.9MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:13:26,201 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.25ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 100.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:13:26,202 INFO L158 Benchmark]: Boogie Preprocessor took 39.18ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 98.3MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:13:26,202 INFO L158 Benchmark]: RCFGBuilder took 591.86ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 62.4MB in the end (delta: 35.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-10 01:13:26,202 INFO L158 Benchmark]: TraceAbstraction took 20547.81ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 61.9MB in the beginning and 324.3MB in the end (delta: -262.4MB). Peak memory consumption was 436.1MB. Max. memory is 16.1GB. [2025-01-10 01:13:26,203 INFO L158 Benchmark]: Witness Printer took 92.23ms. Allocated memory is still 604.0MB. Free memory was 324.3MB in the beginning and 320.0MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:13:26,204 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 122.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.88ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 101.9MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.25ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 100.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.18ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 98.3MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 591.86ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 62.4MB in the end (delta: 35.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 20547.81ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 61.9MB in the beginning and 324.3MB in the end (delta: -262.4MB). Peak memory consumption was 436.1MB. Max. memory is 16.1GB. * Witness Printer took 92.23ms. Allocated memory is still 604.0MB. Free memory was 324.3MB in the beginning and 320.0MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 70]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 51 locations, 14 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.4s, OverallIterations: 16, TraceHistogramMax: 4, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1673 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1639 mSDsluCounter, 375 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 371 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5381 IncrementalHoareTripleChecker+Invalid, 5474 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 4 mSDtfsCounter, 5381 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 601 GetRequests, 395 SyntacticMatches, 1 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=690occurred in iteration=15, InterpolantAutomatonStates: 127, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 608 NumberOfCodeBlocks, 585 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 809 ConstructedInterpolants, 64 QuantifiedInterpolants, 8634 SizeOfPredicates, 60 NumberOfNonLiveVariables, 1391 ConjunctsInSsa, 149 ConjunctsInUnsatCore, 31 InterpolantComputations, 9 PerfectInterpolantSequences, 449/698 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 01:13:26,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE