./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-two-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-two-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 2b29a4c23931df07495caab7fd70ec22fec28fcea21b47e1c8eb19fb44a778d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:13:22,508 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:13:22,589 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:22,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:13:22,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:13:22,632 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:13:22,633 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:13:22,633 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:13:22,633 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:13:22,633 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:13:22,634 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:13:22,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:13:22,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:13:22,637 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:13:22,638 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:13:22,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:13:22,638 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:13:22,638 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:13:22,638 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:13:22,638 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:13:22,638 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:13:22,638 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:13:22,638 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:13:22,638 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:13:22,638 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:13:22,638 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:13:22,638 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:13:22,638 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:13:22,638 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:13:22,639 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:13:22,639 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:13:22,639 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:13:22,639 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:13:22,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:13:22,639 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:13:22,639 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:13:22,639 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:13:22,639 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:13:22,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:13:22,639 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:13:22,639 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:13:22,639 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:13:22,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:13:22,639 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:13:22,639 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:13:22,640 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:13:22,640 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:13:22,640 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 -> 2b29a4c23931df07495caab7fd70ec22fec28fcea21b47e1c8eb19fb44a778d8 [2025-01-10 01:13:22,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:13:22,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:13:22,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:13:22,968 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:13:22,968 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:13:22,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2025-01-10 01:13:24,168 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6319bf6f7/1139f654cdfd4054a5943281bb8e860e/FLAG0bfa7916f [2025-01-10 01:13:24,576 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:13:24,576 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2025-01-10 01:13:24,596 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6319bf6f7/1139f654cdfd4054a5943281bb8e860e/FLAG0bfa7916f [2025-01-10 01:13:24,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6319bf6f7/1139f654cdfd4054a5943281bb8e860e [2025-01-10 01:13:24,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:13:24,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:13:24,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:13:24,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:13:24,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:13:24,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:13:24" (1/1) ... [2025-01-10 01:13:24,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37331eae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:24, skipping insertion in model container [2025-01-10 01:13:24,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:13:24" (1/1) ... [2025-01-10 01:13:24,827 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:13:24,970 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:24,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:13:24,987 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:13:25,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:13:25,032 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:13:25,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:25 WrapperNode [2025-01-10 01:13:25,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:13:25,034 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:13:25,037 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:13:25,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:13:25,045 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:25" (1/1) ... [2025-01-10 01:13:25,054 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:25" (1/1) ... [2025-01-10 01:13:25,082 INFO L138 Inliner]: procedures = 23, calls = 34, calls flagged for inlining = 14, calls inlined = 16, statements flattened = 188 [2025-01-10 01:13:25,082 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:13:25,082 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:13:25,082 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:13:25,082 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:13:25,092 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:25" (1/1) ... [2025-01-10 01:13:25,092 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:25" (1/1) ... [2025-01-10 01:13:25,098 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:25" (1/1) ... [2025-01-10 01:13:25,112 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-01-10 01:13:25,115 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:25" (1/1) ... [2025-01-10 01:13:25,116 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:25" (1/1) ... [2025-01-10 01:13:25,126 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:25" (1/1) ... [2025-01-10 01:13:25,126 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:25" (1/1) ... [2025-01-10 01:13:25,131 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:25" (1/1) ... [2025-01-10 01:13:25,133 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:25" (1/1) ... [2025-01-10 01:13:25,137 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:25" (1/1) ... [2025-01-10 01:13:25,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:13:25,140 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:13:25,143 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:13:25,143 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:13:25,144 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:25" (1/1) ... [2025-01-10 01:13:25,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:13:25,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:25,174 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:25,188 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:25,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:13:25,225 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:13:25,225 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:13:25,225 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:13:25,225 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:13:25,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:13:25,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:13:25,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:13:25,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:13:25,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 01:13:25,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 01:13:25,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:13:25,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:13:25,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:13:25,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:13:25,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:13:25,227 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:25,322 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:13:25,324 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:13:25,587 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:13:25,587 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:13:25,791 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:13:25,792 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:13:25,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:13:25 BoogieIcfgContainer [2025-01-10 01:13:25,793 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:13:25,795 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:13:25,795 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:13:25,799 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:13:25,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:13:24" (1/3) ... [2025-01-10 01:13:25,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26536939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:13:25, skipping insertion in model container [2025-01-10 01:13:25,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:25" (2/3) ... [2025-01-10 01:13:25,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26536939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:13:25, skipping insertion in model container [2025-01-10 01:13:25,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:13:25" (3/3) ... [2025-01-10 01:13:25,801 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2025-01-10 01:13:25,814 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:13:25,816 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-two-queue.wvr.c that has 3 procedures, 41 locations, 1 initial locations, 4 loop locations, and 14 error locations. [2025-01-10 01:13:25,816 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:13:25,855 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 01:13:25,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 44 transitions, 102 flow [2025-01-10 01:13:25,917 INFO L124 PetriNetUnfolderBase]: 4/42 cut-off events. [2025-01-10 01:13:25,918 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:13:25,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 42 events. 4/42 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 96 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-01-10 01:13:25,920 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 44 transitions, 102 flow [2025-01-10 01:13:25,926 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 41 transitions, 94 flow [2025-01-10 01:13:25,933 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:13:25,943 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;@42e67e8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:13:25,943 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-01-10 01:13:25,946 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:13:25,949 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:13:25,949 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:13:25,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:25,950 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:13:25,950 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:13:25,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:25,957 INFO L85 PathProgramCache]: Analyzing trace with hash 608318, now seen corresponding path program 1 times [2025-01-10 01:13:25,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:25,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306392169] [2025-01-10 01:13:25,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:25,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:26,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:13:26,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:13:26,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:26,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:26,194 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:26,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:26,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306392169] [2025-01-10 01:13:26,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306392169] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:26,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:26,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:13:26,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921990141] [2025-01-10 01:13:26,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:26,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:13:26,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:26,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:13:26,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:13:26,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-01-10 01:13:26,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:26,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:26,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-01-10 01:13:26,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:26,410 INFO L124 PetriNetUnfolderBase]: 359/589 cut-off events. [2025-01-10 01:13:26,410 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-01-10 01:13:26,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1172 conditions, 589 events. 359/589 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 2760 event pairs, 219 based on Foata normal form. 1/359 useless extension candidates. Maximal degree in co-relation 1090. Up to 544 conditions per place. [2025-01-10 01:13:26,419 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 28 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-01-10 01:13:26,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 146 flow [2025-01-10 01:13:26,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:13:26,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:13:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2025-01-10 01:13:26,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2025-01-10 01:13:26,429 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 94 flow. Second operand 3 states and 63 transitions. [2025-01-10 01:13:26,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 146 flow [2025-01-10 01:13:26,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 138 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:13:26,435 INFO L231 Difference]: Finished difference. Result has 38 places, 37 transitions, 82 flow [2025-01-10 01:13:26,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=38, PETRI_TRANSITIONS=37} [2025-01-10 01:13:26,439 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -6 predicate places. [2025-01-10 01:13:26,439 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 37 transitions, 82 flow [2025-01-10 01:13:26,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:26,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:26,439 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:13:26,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:13:26,440 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:13:26,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:26,440 INFO L85 PathProgramCache]: Analyzing trace with hash 608319, now seen corresponding path program 1 times [2025-01-10 01:13:26,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:26,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928046800] [2025-01-10 01:13:26,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:26,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:26,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:13:26,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:13:26,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:26,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:26,676 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:26,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:26,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928046800] [2025-01-10 01:13:26,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928046800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:26,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:26,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:13:26,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483499928] [2025-01-10 01:13:26,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:26,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:13:26,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:26,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:13:26,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:13:26,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-01-10 01:13:26,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 37 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:26,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:26,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-01-10 01:13:26,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:26,928 INFO L124 PetriNetUnfolderBase]: 360/592 cut-off events. [2025-01-10 01:13:26,929 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:13:26,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1161 conditions, 592 events. 360/592 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 2786 event pairs, 219 based on Foata normal form. 0/359 useless extension candidates. Maximal degree in co-relation 1132. Up to 553 conditions per place. [2025-01-10 01:13:26,934 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 31 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2025-01-10 01:13:26,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 158 flow [2025-01-10 01:13:26,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:13:26,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:13:26,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-01-10 01:13:26,936 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-01-10 01:13:26,936 INFO L175 Difference]: Start difference. First operand has 38 places, 37 transitions, 82 flow. Second operand 4 states and 76 transitions. [2025-01-10 01:13:26,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 158 flow [2025-01-10 01:13:26,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:26,938 INFO L231 Difference]: Finished difference. Result has 41 places, 40 transitions, 105 flow [2025-01-10 01:13:26,938 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=41, PETRI_TRANSITIONS=40} [2025-01-10 01:13:26,939 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2025-01-10 01:13:26,939 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 40 transitions, 105 flow [2025-01-10 01:13:26,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:26,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:26,940 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:13:26,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:13:26,940 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:13:26,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:26,940 INFO L85 PathProgramCache]: Analyzing trace with hash 18859193, now seen corresponding path program 1 times [2025-01-10 01:13:26,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:26,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578974070] [2025-01-10 01:13:26,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:26,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:26,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:13:26,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:13:26,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:26,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:27,214 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:27,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:27,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578974070] [2025-01-10 01:13:27,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578974070] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:27,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:27,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:13:27,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607846966] [2025-01-10 01:13:27,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:27,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:13:27,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:27,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:13:27,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:13:27,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-01-10 01:13:27,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 40 transitions, 105 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:27,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:27,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-01-10 01:13:27,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:27,373 INFO L124 PetriNetUnfolderBase]: 361/595 cut-off events. [2025-01-10 01:13:27,373 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:13:27,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1178 conditions, 595 events. 361/595 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 2780 event pairs, 219 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 1153. Up to 552 conditions per place. [2025-01-10 01:13:27,377 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 31 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2025-01-10 01:13:27,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 187 flow [2025-01-10 01:13:27,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:13:27,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:13:27,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2025-01-10 01:13:27,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40454545454545454 [2025-01-10 01:13:27,378 INFO L175 Difference]: Start difference. First operand has 41 places, 40 transitions, 105 flow. Second operand 5 states and 89 transitions. [2025-01-10 01:13:27,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 187 flow [2025-01-10 01:13:27,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 184 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:13:27,380 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 139 flow [2025-01-10 01:13:27,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2025-01-10 01:13:27,380 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2025-01-10 01:13:27,380 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 139 flow [2025-01-10 01:13:27,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:27,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:27,381 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:13:27,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:13:27,381 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:13:27,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:27,381 INFO L85 PathProgramCache]: Analyzing trace with hash 584613785, now seen corresponding path program 1 times [2025-01-10 01:13:27,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:27,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220489968] [2025-01-10 01:13:27,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:27,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:27,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:13:27,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:13:27,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:27,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:27,557 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:27,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:27,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220489968] [2025-01-10 01:13:27,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220489968] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:27,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682489962] [2025-01-10 01:13:27,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:27,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:27,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:27,562 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:27,562 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:27,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:13:27,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:13:27,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:27,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:27,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:13:27,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:27,658 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:27,811 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:27,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:27,890 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:27,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682489962] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:27,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:27,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:13:27,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125345561] [2025-01-10 01:13:27,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:27,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:13:27,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:27,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:13:27,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:13:27,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-01-10 01:13:27,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 139 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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:27,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:27,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-01-10 01:13:27,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:28,235 INFO L124 PetriNetUnfolderBase]: 362/597 cut-off events. [2025-01-10 01:13:28,235 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-10 01:13:28,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1201 conditions, 597 events. 362/597 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 2806 event pairs, 219 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 1163. Up to 553 conditions per place. [2025-01-10 01:13:28,239 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 30 selfloop transitions, 10 changer transitions 0/45 dead transitions. [2025-01-10 01:13:28,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 45 transitions, 230 flow [2025-01-10 01:13:28,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:13:28,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:13:28,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2025-01-10 01:13:28,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3380681818181818 [2025-01-10 01:13:28,241 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 139 flow. Second operand 8 states and 119 transitions. [2025-01-10 01:13:28,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 45 transitions, 230 flow [2025-01-10 01:13:28,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 45 transitions, 229 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:13:28,242 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 169 flow [2025-01-10 01:13:28,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=169, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2025-01-10 01:13:28,243 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2025-01-10 01:13:28,243 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 169 flow [2025-01-10 01:13:28,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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:28,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:28,243 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 01:13:28,251 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:28,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:28,448 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:13:28,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:28,449 INFO L85 PathProgramCache]: Analyzing trace with hash 943834077, now seen corresponding path program 1 times [2025-01-10 01:13:28,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:28,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831939898] [2025-01-10 01:13:28,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:28,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:28,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:13:28,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:13:28,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:28,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:28,638 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:28,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:28,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831939898] [2025-01-10 01:13:28,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831939898] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:28,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316601555] [2025-01-10 01:13:28,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:28,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:28,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:28,644 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:28,647 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:28,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:13:28,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:13:28,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:28,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:28,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:13:28,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:28,709 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:28,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:28,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:29,037 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:29,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316601555] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:29,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:29,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-01-10 01:13:29,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462837883] [2025-01-10 01:13:29,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:29,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:13:29,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:29,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:13:29,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:13:29,121 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-01-10 01:13:29,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 169 flow. Second operand has 13 states, 13 states have (on average 11.307692307692308) internal successors, (147), 13 states have internal predecessors, (147), 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:29,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:29,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-01-10 01:13:29,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:29,507 INFO L124 PetriNetUnfolderBase]: 362/596 cut-off events. [2025-01-10 01:13:29,508 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-10 01:13:29,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1208 conditions, 596 events. 362/596 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 2831 event pairs, 219 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 1162. Up to 544 conditions per place. [2025-01-10 01:13:29,510 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 24 selfloop transitions, 15 changer transitions 0/44 dead transitions. [2025-01-10 01:13:29,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 44 transitions, 243 flow [2025-01-10 01:13:29,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:13:29,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:13:29,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2025-01-10 01:13:29,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3474025974025974 [2025-01-10 01:13:29,512 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 169 flow. Second operand 7 states and 107 transitions. [2025-01-10 01:13:29,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 44 transitions, 243 flow [2025-01-10 01:13:29,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 44 transitions, 196 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-01-10 01:13:29,513 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 148 flow [2025-01-10 01:13:29,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=148, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2025-01-10 01:13:29,514 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2025-01-10 01:13:29,514 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 148 flow [2025-01-10 01:13:29,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.307692307692308) internal successors, (147), 13 states have internal predecessors, (147), 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:29,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:29,514 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:29,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:13:29,718 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:29,718 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:13:29,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:29,718 INFO L85 PathProgramCache]: Analyzing trace with hash -803562685, now seen corresponding path program 1 times [2025-01-10 01:13:29,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:29,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110118891] [2025-01-10 01:13:29,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:29,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:29,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:13:29,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:13:29,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:29,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:29,766 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:29,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:29,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110118891] [2025-01-10 01:13:29,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110118891] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:29,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:29,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:13:29,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096047695] [2025-01-10 01:13:29,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:29,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:13:29,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:29,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:13:29,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:13:29,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-01-10 01:13:29,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:29,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:29,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-01-10 01:13:29,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:29,848 INFO L124 PetriNetUnfolderBase]: 284/479 cut-off events. [2025-01-10 01:13:29,848 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 01:13:29,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 965 conditions, 479 events. 284/479 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2142 event pairs, 171 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 910. Up to 430 conditions per place. [2025-01-10 01:13:29,850 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 34 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2025-01-10 01:13:29,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 218 flow [2025-01-10 01:13:29,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:13:29,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:13:29,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2025-01-10 01:13:29,851 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2025-01-10 01:13:29,851 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 148 flow. Second operand 4 states and 70 transitions. [2025-01-10 01:13:29,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 218 flow [2025-01-10 01:13:29,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 42 transitions, 191 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-01-10 01:13:29,852 INFO L231 Difference]: Finished difference. Result has 44 places, 42 transitions, 123 flow [2025-01-10 01:13:29,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=44, PETRI_TRANSITIONS=42} [2025-01-10 01:13:29,853 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2025-01-10 01:13:29,853 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 123 flow [2025-01-10 01:13:29,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:29,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:29,853 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:29,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:13:29,854 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:13:29,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:29,854 INFO L85 PathProgramCache]: Analyzing trace with hash -803562684, now seen corresponding path program 1 times [2025-01-10 01:13:29,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:29,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433394030] [2025-01-10 01:13:29,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:29,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:29,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:13:29,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:13:29,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:29,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:29,904 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:29,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:29,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433394030] [2025-01-10 01:13:29,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433394030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:29,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:29,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:13:29,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514601839] [2025-01-10 01:13:29,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:29,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:13:29,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:29,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:13:29,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:13:29,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2025-01-10 01:13:29,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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:29,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:29,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2025-01-10 01:13:29,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:29,997 INFO L124 PetriNetUnfolderBase]: 306/540 cut-off events. [2025-01-10 01:13:29,998 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:13:29,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 540 events. 306/540 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2544 event pairs, 194 based on Foata normal form. 15/387 useless extension candidates. Maximal degree in co-relation 900. Up to 440 conditions per place. [2025-01-10 01:13:30,000 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 43 selfloop transitions, 5 changer transitions 1/54 dead transitions. [2025-01-10 01:13:30,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 249 flow [2025-01-10 01:13:30,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:13:30,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:13:30,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-01-10 01:13:30,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5397727272727273 [2025-01-10 01:13:30,001 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 123 flow. Second operand 4 states and 95 transitions. [2025-01-10 01:13:30,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 249 flow [2025-01-10 01:13:30,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 54 transitions, 245 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:30,002 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 138 flow [2025-01-10 01:13:30,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2025-01-10 01:13:30,003 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2025-01-10 01:13:30,003 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 138 flow [2025-01-10 01:13:30,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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:30,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:30,003 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:30,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:13:30,003 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:13:30,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:30,004 INFO L85 PathProgramCache]: Analyzing trace with hash 859912364, now seen corresponding path program 1 times [2025-01-10 01:13:30,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:30,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265736427] [2025-01-10 01:13:30,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:30,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:30,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:13:30,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:13:30,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:30,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:30,051 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:30,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:30,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265736427] [2025-01-10 01:13:30,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265736427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:30,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:30,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:13:30,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086822885] [2025-01-10 01:13:30,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:30,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:13:30,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:30,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:13:30,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:13:30,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2025-01-10 01:13:30,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:30,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:30,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2025-01-10 01:13:30,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:30,155 INFO L124 PetriNetUnfolderBase]: 334/636 cut-off events. [2025-01-10 01:13:30,156 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-01-10 01:13:30,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1382 conditions, 636 events. 334/636 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3316 event pairs, 222 based on Foata normal form. 14/473 useless extension candidates. Maximal degree in co-relation 1012. Up to 496 conditions per place. [2025-01-10 01:13:30,159 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 50 selfloop transitions, 3 changer transitions 1/59 dead transitions. [2025-01-10 01:13:30,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 307 flow [2025-01-10 01:13:30,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:13:30,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:13:30,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-01-10 01:13:30,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-01-10 01:13:30,160 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 138 flow. Second operand 4 states and 99 transitions. [2025-01-10 01:13:30,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 307 flow [2025-01-10 01:13:30,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 302 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:13:30,161 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 153 flow [2025-01-10 01:13:30,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2025-01-10 01:13:30,161 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2025-01-10 01:13:30,161 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 153 flow [2025-01-10 01:13:30,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:30,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:30,162 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:30,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:13:30,162 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:13:30,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:30,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1386964576, now seen corresponding path program 1 times [2025-01-10 01:13:30,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:30,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854677812] [2025-01-10 01:13:30,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:30,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:30,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:13:30,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:13:30,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:30,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:30,313 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:30,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:30,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854677812] [2025-01-10 01:13:30,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854677812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:30,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:30,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:13:30,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92801550] [2025-01-10 01:13:30,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:30,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:13:30,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:30,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:13:30,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:13:30,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2025-01-10 01:13:30,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 153 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:30,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:30,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2025-01-10 01:13:30,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:30,425 INFO L124 PetriNetUnfolderBase]: 260/519 cut-off events. [2025-01-10 01:13:30,425 INFO L125 PetriNetUnfolderBase]: For 87/102 co-relation queries the response was YES. [2025-01-10 01:13:30,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 519 events. 260/519 cut-off events. For 87/102 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2626 event pairs, 174 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 1041. Up to 446 conditions per place. [2025-01-10 01:13:30,428 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 30 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2025-01-10 01:13:30,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 40 transitions, 215 flow [2025-01-10 01:13:30,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:13:30,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:13:30,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-01-10 01:13:30,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-01-10 01:13:30,429 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 153 flow. Second operand 4 states and 76 transitions. [2025-01-10 01:13:30,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 40 transitions, 215 flow [2025-01-10 01:13:30,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:30,430 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 150 flow [2025-01-10 01:13:30,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2025-01-10 01:13:30,431 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2025-01-10 01:13:30,431 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 150 flow [2025-01-10 01:13:30,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:30,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:30,431 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:30,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:13:30,431 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:13:30,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:30,432 INFO L85 PathProgramCache]: Analyzing trace with hash -830733178, now seen corresponding path program 1 times [2025-01-10 01:13:30,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:30,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530286523] [2025-01-10 01:13:30,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:30,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:30,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:13:30,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:13:30,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:30,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:30,499 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:30,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:30,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530286523] [2025-01-10 01:13:30,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530286523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:30,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:30,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:13:30,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112985568] [2025-01-10 01:13:30,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:30,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:13:30,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:30,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:13:30,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:13:30,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-01-10 01:13:30,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:30,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:30,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-01-10 01:13:30,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:30,569 INFO L124 PetriNetUnfolderBase]: 196/417 cut-off events. [2025-01-10 01:13:30,569 INFO L125 PetriNetUnfolderBase]: For 78/86 co-relation queries the response was YES. [2025-01-10 01:13:30,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 417 events. 196/417 cut-off events. For 78/86 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2005 event pairs, 132 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 626. Up to 348 conditions per place. [2025-01-10 01:13:30,571 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 27 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2025-01-10 01:13:30,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 38 transitions, 208 flow [2025-01-10 01:13:30,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:13:30,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:13:30,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2025-01-10 01:13:30,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34545454545454546 [2025-01-10 01:13:30,572 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 150 flow. Second operand 5 states and 76 transitions. [2025-01-10 01:13:30,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 38 transitions, 208 flow [2025-01-10 01:13:30,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 38 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:30,573 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 146 flow [2025-01-10 01:13:30,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2025-01-10 01:13:30,574 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2025-01-10 01:13:30,574 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 146 flow [2025-01-10 01:13:30,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:30,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:30,574 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:30,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:13:30,574 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:13:30,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:30,574 INFO L85 PathProgramCache]: Analyzing trace with hash -830733177, now seen corresponding path program 1 times [2025-01-10 01:13:30,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:30,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770629304] [2025-01-10 01:13:30,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:30,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:30,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:13:30,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:13:30,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:30,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:30,705 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:30,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:30,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770629304] [2025-01-10 01:13:30,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770629304] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:30,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:30,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:13:30,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799265108] [2025-01-10 01:13:30,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:30,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:13:30,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:30,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:13:30,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:13:30,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-01-10 01:13:30,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:30,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:30,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-01-10 01:13:30,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:30,788 INFO L124 PetriNetUnfolderBase]: 142/329 cut-off events. [2025-01-10 01:13:30,788 INFO L125 PetriNetUnfolderBase]: For 67/70 co-relation queries the response was YES. [2025-01-10 01:13:30,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 329 events. 142/329 cut-off events. For 67/70 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1553 event pairs, 96 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 425. Up to 275 conditions per place. [2025-01-10 01:13:30,789 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 27 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2025-01-10 01:13:30,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 36 transitions, 200 flow [2025-01-10 01:13:30,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:13:30,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:13:30,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2025-01-10 01:13:30,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2025-01-10 01:13:30,790 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 146 flow. Second operand 4 states and 64 transitions. [2025-01-10 01:13:30,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 36 transitions, 200 flow [2025-01-10 01:13:30,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 36 transitions, 190 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:13:30,791 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 136 flow [2025-01-10 01:13:30,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-01-10 01:13:30,792 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2025-01-10 01:13:30,792 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 136 flow [2025-01-10 01:13:30,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:30,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:30,792 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:30,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:13:30,792 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:13:30,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:30,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1918607941, now seen corresponding path program 1 times [2025-01-10 01:13:30,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:30,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755694543] [2025-01-10 01:13:30,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:30,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:30,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:13:30,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:13:30,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:30,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:30,831 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:30,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:30,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755694543] [2025-01-10 01:13:30,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755694543] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:30,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:30,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:13:30,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893196083] [2025-01-10 01:13:30,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:30,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:13:30,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:30,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:13:30,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:13:30,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2025-01-10 01:13:30,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 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:30,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:30,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2025-01-10 01:13:30,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:30,910 INFO L124 PetriNetUnfolderBase]: 178/391 cut-off events. [2025-01-10 01:13:30,910 INFO L125 PetriNetUnfolderBase]: For 85/88 co-relation queries the response was YES. [2025-01-10 01:13:30,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 904 conditions, 391 events. 178/391 cut-off events. For 85/88 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1864 event pairs, 61 based on Foata normal form. 4/380 useless extension candidates. Maximal degree in co-relation 694. Up to 181 conditions per place. [2025-01-10 01:13:30,912 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 36 selfloop transitions, 3 changer transitions 3/47 dead transitions. [2025-01-10 01:13:30,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 253 flow [2025-01-10 01:13:30,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:13:30,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:13:30,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-01-10 01:13:30,916 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2025-01-10 01:13:30,916 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 136 flow. Second operand 3 states and 70 transitions. [2025-01-10 01:13:30,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 253 flow [2025-01-10 01:13:30,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:30,917 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 138 flow [2025-01-10 01:13:30,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2025-01-10 01:13:30,918 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2025-01-10 01:13:30,918 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 138 flow [2025-01-10 01:13:30,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 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:30,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:30,918 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:30,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:13:30,918 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:13:30,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:30,919 INFO L85 PathProgramCache]: Analyzing trace with hash 115689536, now seen corresponding path program 1 times [2025-01-10 01:13:30,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:30,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480044902] [2025-01-10 01:13:30,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:30,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:30,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:13:30,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:13:30,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:30,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:30,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:13:30,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:30,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480044902] [2025-01-10 01:13:30,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480044902] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:30,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:30,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:13:30,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199275814] [2025-01-10 01:13:30,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:30,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:13:30,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:30,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:13:30,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:13:30,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2025-01-10 01:13:30,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:30,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:30,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2025-01-10 01:13:30,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:31,019 INFO L124 PetriNetUnfolderBase]: 106/215 cut-off events. [2025-01-10 01:13:31,019 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2025-01-10 01:13:31,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 215 events. 106/215 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 740 event pairs, 22 based on Foata normal form. 6/212 useless extension candidates. Maximal degree in co-relation 508. Up to 143 conditions per place. [2025-01-10 01:13:31,020 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 34 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2025-01-10 01:13:31,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 43 transitions, 234 flow [2025-01-10 01:13:31,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:13:31,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:13:31,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-01-10 01:13:31,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-01-10 01:13:31,021 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 138 flow. Second operand 3 states and 66 transitions. [2025-01-10 01:13:31,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 43 transitions, 234 flow [2025-01-10 01:13:31,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 43 transitions, 231 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:13:31,022 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 149 flow [2025-01-10 01:13:31,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=149, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2025-01-10 01:13:31,022 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2025-01-10 01:13:31,022 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 149 flow [2025-01-10 01:13:31,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:31,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:31,022 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:31,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:13:31,022 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:13:31,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:31,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1098855018, now seen corresponding path program 1 times [2025-01-10 01:13:31,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:31,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971535785] [2025-01-10 01:13:31,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:31,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:31,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:13:31,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:13:31,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:31,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:31,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:13:31,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:31,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971535785] [2025-01-10 01:13:31,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971535785] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:31,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:31,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:13:31,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964455361] [2025-01-10 01:13:31,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:31,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:13:31,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:31,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:13:31,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:13:31,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2025-01-10 01:13:31,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 149 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:31,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:31,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2025-01-10 01:13:31,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:31,132 INFO L124 PetriNetUnfolderBase]: 81/175 cut-off events. [2025-01-10 01:13:31,132 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2025-01-10 01:13:31,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 175 events. 81/175 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 491 event pairs, 27 based on Foata normal form. 5/172 useless extension candidates. Maximal degree in co-relation 427. Up to 112 conditions per place. [2025-01-10 01:13:31,133 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 35 selfloop transitions, 2 changer transitions 4/46 dead transitions. [2025-01-10 01:13:31,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 46 transitions, 259 flow [2025-01-10 01:13:31,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:13:31,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:13:31,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-01-10 01:13:31,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2025-01-10 01:13:31,140 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 149 flow. Second operand 3 states and 68 transitions. [2025-01-10 01:13:31,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 46 transitions, 259 flow [2025-01-10 01:13:31,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 252 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-10 01:13:31,141 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 159 flow [2025-01-10 01:13:31,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=159, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2025-01-10 01:13:31,142 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2025-01-10 01:13:31,142 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 159 flow [2025-01-10 01:13:31,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:31,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:31,142 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:31,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:13:31,143 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:13:31,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:31,143 INFO L85 PathProgramCache]: Analyzing trace with hash 812723327, now seen corresponding path program 1 times [2025-01-10 01:13:31,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:31,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729190351] [2025-01-10 01:13:31,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:31,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:31,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 01:13:31,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:13:31,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:31,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:32,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:13:32,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:32,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729190351] [2025-01-10 01:13:32,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729190351] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:32,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562149536] [2025-01-10 01:13:32,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:32,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:32,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:32,513 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:32,514 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:32,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 01:13:32,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:13:32,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:32,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:32,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-01-10 01:13:32,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:32,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:13:32,701 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:32,765 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:13:32,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:13:32,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:33,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:13:33,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:36,275 INFO L349 Elim1Store]: treesize reduction 32, result has 63.2 percent of original size [2025-01-10 01:13:36,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 308 treesize of output 298 [2025-01-10 01:13:36,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:13:36,302 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 294 treesize of output 286 [2025-01-10 01:13:37,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:13:37,409 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 34 treesize of output 28 [2025-01-10 01:13:37,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 12 [2025-01-10 01:13:37,456 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2025-01-10 01:13:37,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 79 treesize of output 51 [2025-01-10 01:13:37,484 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-01-10 01:13:37,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 66 treesize of output 1 [2025-01-10 01:13:37,492 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-01-10 01:13:37,492 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 45 treesize of output 1 [2025-01-10 01:13:37,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:13:37,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 107 [2025-01-10 01:13:37,610 INFO L349 Elim1Store]: treesize reduction 23, result has 68.5 percent of original size [2025-01-10 01:13:37,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 71 [2025-01-10 01:13:37,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:13:37,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:13:37,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 29 treesize of output 35 [2025-01-10 01:13:37,681 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-01-10 01:13:37,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 44 treesize of output 1 [2025-01-10 01:13:37,693 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-01-10 01:13:37,693 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 44 treesize of output 1 [2025-01-10 01:13:37,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:13:37,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 8 [2025-01-10 01:13:37,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:13:37,718 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-01-10 01:13:37,718 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 45 treesize of output 1 [2025-01-10 01:13:37,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:13:37,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:13:37,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:13:37,728 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-01-10 01:13:37,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:13:37,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:13:37,738 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-01-10 01:13:37,773 INFO L349 Elim1Store]: treesize reduction 5, result has 87.8 percent of original size [2025-01-10 01:13:37,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 44 treesize of output 55 [2025-01-10 01:13:37,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:13:37,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:13:37,795 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-01-10 01:13:37,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:13:37,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 12 [2025-01-10 01:13:37,815 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-01-10 01:13:37,822 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-01-10 01:13:37,822 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 45 treesize of output 1 [2025-01-10 01:13:37,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:13:37,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:13:37,829 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-01-10 01:13:37,837 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-01-10 01:13:37,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:13:37,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:13:37,847 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-10 01:13:37,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 1 [2025-01-10 01:13:37,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 67 treesize of output 55 [2025-01-10 01:13:37,866 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-01-10 01:13:37,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 29 treesize of output 1 [2025-01-10 01:13:37,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 34 treesize of output 28 [2025-01-10 01:13:37,879 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-10 01:13:37,879 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 20 treesize of output 1 [2025-01-10 01:13:37,883 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-01-10 01:13:37,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:13:37,893 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-10 01:13:37,894 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 20 treesize of output 1 [2025-01-10 01:13:37,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:13:37,906 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-10 01:13:37,906 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 20 treesize of output 1 [2025-01-10 01:13:37,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:13:37,917 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-01-10 01:13:37,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 29 treesize of output 1 [2025-01-10 01:13:37,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:13:37,930 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-01-10 01:13:37,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 29 treesize of output 1 [2025-01-10 01:13:37,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:13:37,945 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-10 01:13:37,946 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 20 treesize of output 1 [2025-01-10 01:13:37,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:13:37,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 34 treesize of output 28 [2025-01-10 01:13:37,983 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-10 01:13:37,983 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 20 treesize of output 1 [2025-01-10 01:13:37,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:13:37,998 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-10 01:13:37,998 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 20 treesize of output 1 [2025-01-10 01:13:38,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:13:38,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 34 treesize of output 28 [2025-01-10 01:13:38,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 8 [2025-01-10 01:13:38,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:13:38,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 8 [2025-01-10 01:13:38,043 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-01-10 01:13:38,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:13:38,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562149536] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:38,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:38,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 36 [2025-01-10 01:13:38,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478001145] [2025-01-10 01:13:38,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:38,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-10 01:13:38,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:38,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-10 01:13:38,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1195, Unknown=0, NotChecked=0, Total=1332 [2025-01-10 01:13:39,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 44 [2025-01-10 01:13:39,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 159 flow. Second operand has 37 states, 37 states have (on average 9.864864864864865) internal successors, (365), 37 states have internal predecessors, (365), 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:39,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:39,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 44 [2025-01-10 01:13:39,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:49,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:13:57,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:14:02,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:14:08,492 INFO L124 PetriNetUnfolderBase]: 644/1198 cut-off events. [2025-01-10 01:14:08,492 INFO L125 PetriNetUnfolderBase]: For 669/669 co-relation queries the response was YES. [2025-01-10 01:14:08,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3181 conditions, 1198 events. 644/1198 cut-off events. For 669/669 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 6004 event pairs, 154 based on Foata normal form. 34/1036 useless extension candidates. Maximal degree in co-relation 2751. Up to 216 conditions per place. [2025-01-10 01:14:08,497 INFO L140 encePairwiseOnDemand]: 27/44 looper letters, 137 selfloop transitions, 89 changer transitions 36/265 dead transitions. [2025-01-10 01:14:08,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 265 transitions, 1475 flow [2025-01-10 01:14:08,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-01-10 01:14:08,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-01-10 01:14:08,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 605 transitions. [2025-01-10 01:14:08,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31976744186046513 [2025-01-10 01:14:08,501 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 159 flow. Second operand 43 states and 605 transitions. [2025-01-10 01:14:08,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 265 transitions, 1475 flow [2025-01-10 01:14:08,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 265 transitions, 1444 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-01-10 01:14:08,506 INFO L231 Difference]: Finished difference. Result has 103 places, 124 transitions, 863 flow [2025-01-10 01:14:08,506 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=863, PETRI_PLACES=103, PETRI_TRANSITIONS=124} [2025-01-10 01:14:08,507 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 59 predicate places. [2025-01-10 01:14:08,507 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 124 transitions, 863 flow [2025-01-10 01:14:08,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 9.864864864864865) internal successors, (365), 37 states have internal predecessors, (365), 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:14:08,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:08,507 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:08,514 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:14:08,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:08,708 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:14:08,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:08,709 INFO L85 PathProgramCache]: Analyzing trace with hash -344886423, now seen corresponding path program 2 times [2025-01-10 01:14:08,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:08,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965407674] [2025-01-10 01:14:08,709 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:08,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:08,718 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-10 01:14:08,757 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 27 statements. [2025-01-10 01:14:08,761 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:08,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:09,483 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:14:09,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:09,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965407674] [2025-01-10 01:14:09,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965407674] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:09,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:09,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 01:14:09,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771679077] [2025-01-10 01:14:09,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:09,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:14:09,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:09,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:14:09,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:14:09,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-01-10 01:14:09,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 124 transitions, 863 flow. Second operand has 12 states, 12 states have (on average 12.0) internal successors, (144), 12 states have internal predecessors, (144), 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:14:09,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:09,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-01-10 01:14:09,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:10,868 INFO L124 PetriNetUnfolderBase]: 678/1269 cut-off events. [2025-01-10 01:14:10,868 INFO L125 PetriNetUnfolderBase]: For 3581/3581 co-relation queries the response was YES. [2025-01-10 01:14:10,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4890 conditions, 1269 events. 678/1269 cut-off events. For 3581/3581 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6400 event pairs, 138 based on Foata normal form. 27/1287 useless extension candidates. Maximal degree in co-relation 4556. Up to 770 conditions per place. [2025-01-10 01:14:10,883 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 128 selfloop transitions, 53 changer transitions 8/192 dead transitions. [2025-01-10 01:14:10,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 192 transitions, 1658 flow [2025-01-10 01:14:10,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:14:10,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:14:10,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 199 transitions. [2025-01-10 01:14:10,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41115702479338845 [2025-01-10 01:14:10,887 INFO L175 Difference]: Start difference. First operand has 103 places, 124 transitions, 863 flow. Second operand 11 states and 199 transitions. [2025-01-10 01:14:10,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 192 transitions, 1658 flow [2025-01-10 01:14:10,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 192 transitions, 1469 flow, removed 92 selfloop flow, removed 3 redundant places. [2025-01-10 01:14:10,909 INFO L231 Difference]: Finished difference. Result has 116 places, 151 transitions, 1100 flow [2025-01-10 01:14:10,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1100, PETRI_PLACES=116, PETRI_TRANSITIONS=151} [2025-01-10 01:14:10,909 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 72 predicate places. [2025-01-10 01:14:10,909 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 151 transitions, 1100 flow [2025-01-10 01:14:10,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.0) internal successors, (144), 12 states have internal predecessors, (144), 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:14:10,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:10,910 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:10,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:14:10,910 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:14:10,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:10,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1447648451, now seen corresponding path program 3 times [2025-01-10 01:14:10,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:10,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15421429] [2025-01-10 01:14:10,910 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:14:10,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:10,924 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-01-10 01:14:10,953 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 27 statements. [2025-01-10 01:14:10,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:14:10,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:11,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:14:11,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:11,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15421429] [2025-01-10 01:14:11,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15421429] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:11,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:11,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 01:14:11,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660988001] [2025-01-10 01:14:11,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:11,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:14:11,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:11,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:14:11,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:14:12,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-01-10 01:14:12,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 151 transitions, 1100 flow. Second operand has 12 states, 12 states have (on average 12.0) internal successors, (144), 12 states have internal predecessors, (144), 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:14:12,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:12,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-01-10 01:14:12,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:13,325 INFO L124 PetriNetUnfolderBase]: 771/1427 cut-off events. [2025-01-10 01:14:13,329 INFO L125 PetriNetUnfolderBase]: For 5664/5664 co-relation queries the response was YES. [2025-01-10 01:14:13,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6334 conditions, 1427 events. 771/1427 cut-off events. For 5664/5664 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7393 event pairs, 167 based on Foata normal form. 1/1418 useless extension candidates. Maximal degree in co-relation 5951. Up to 941 conditions per place. [2025-01-10 01:14:13,337 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 146 selfloop transitions, 50 changer transitions 8/207 dead transitions. [2025-01-10 01:14:13,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 207 transitions, 1837 flow [2025-01-10 01:14:13,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:14:13,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:14:13,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 195 transitions. [2025-01-10 01:14:13,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40289256198347106 [2025-01-10 01:14:13,346 INFO L175 Difference]: Start difference. First operand has 116 places, 151 transitions, 1100 flow. Second operand 11 states and 195 transitions. [2025-01-10 01:14:13,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 207 transitions, 1837 flow [2025-01-10 01:14:13,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 207 transitions, 1773 flow, removed 28 selfloop flow, removed 1 redundant places. [2025-01-10 01:14:13,366 INFO L231 Difference]: Finished difference. Result has 128 places, 166 transitions, 1318 flow [2025-01-10 01:14:13,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1318, PETRI_PLACES=128, PETRI_TRANSITIONS=166} [2025-01-10 01:14:13,366 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 84 predicate places. [2025-01-10 01:14:13,366 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 166 transitions, 1318 flow [2025-01-10 01:14:13,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.0) internal successors, (144), 12 states have internal predecessors, (144), 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:14:13,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:13,367 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:13,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:14:13,367 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:14:13,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:13,367 INFO L85 PathProgramCache]: Analyzing trace with hash 693193531, now seen corresponding path program 4 times [2025-01-10 01:14:13,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:13,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135216317] [2025-01-10 01:14:13,367 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:14:13,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:13,378 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-01-10 01:14:13,407 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:14:13,407 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:14:13,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:15,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:15,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:15,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135216317] [2025-01-10 01:14:15,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135216317] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:15,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650734483] [2025-01-10 01:14:15,650 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:14:15,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:15,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:15,653 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:14:15,654 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:14:15,695 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-01-10 01:14:15,716 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:14:15,717 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:14:15,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:15,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-01-10 01:14:15,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:15,733 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:14:15,929 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:14:16,104 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:14:16,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:14:16,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:14:17,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2025-01-10 01:14:17,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:17,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:21,758 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 01:14:21,926 INFO L349 Elim1Store]: treesize reduction 32, result has 63.2 percent of original size [2025-01-10 01:14:21,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 108 [2025-01-10 01:14:21,947 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 01:14:21,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 88 [2025-01-10 01:14:21,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 14 [2025-01-10 01:14:22,080 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-01-10 01:14:22,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 70 treesize of output 62 [2025-01-10 01:14:22,199 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 01:14:22,354 INFO L349 Elim1Store]: treesize reduction 32, result has 63.2 percent of original size [2025-01-10 01:14:22,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 131 treesize of output 137 [2025-01-10 01:14:22,369 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 01:14:22,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 117 [2025-01-10 01:14:22,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 66 treesize of output 54 [2025-01-10 01:14:22,456 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-01-10 01:14:22,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 102 treesize of output 82 [2025-01-10 01:14:23,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:23,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650734483] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:23,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:23,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 40 [2025-01-10 01:14:23,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794626205] [2025-01-10 01:14:23,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:23,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-01-10 01:14:23,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:23,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-01-10 01:14:23,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1487, Unknown=0, NotChecked=0, Total=1640 [2025-01-10 01:14:26,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 44 [2025-01-10 01:14:26,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 166 transitions, 1318 flow. Second operand has 41 states, 41 states have (on average 9.682926829268293) internal successors, (397), 41 states have internal predecessors, (397), 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:14:26,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:26,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 44 [2025-01-10 01:14:26,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:31,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:15:03,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]