./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/unroll-cond-4.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/unroll-cond-4.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 6b28fb6889d0d92f72216f98e0edff81bbc7a955814acfd4caad3db76eb7ead3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:14:37,692 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:14:37,732 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:14:37,735 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:14:37,735 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:14:37,763 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:14:37,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:14:37,763 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:14:37,764 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:14:37,764 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:14:37,764 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:14:37,764 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:14:37,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:14:37,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:14:37,764 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:14:37,764 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:14:37,764 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:14:37,764 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:14:37,764 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:14:37,764 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:14:37,764 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:14:37,764 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:14:37,764 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:14:37,764 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:14:37,765 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:14:37,765 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:14:37,765 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:14:37,765 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:14:37,765 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:14:37,765 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:14:37,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:14:37,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:14:37,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:14:37,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:14:37,765 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:14:37,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:14:37,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:14:37,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:14:37,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:14:37,765 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:14:37,765 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:14:37,765 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:14:37,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:14:37,765 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:14:37,765 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:14:37,765 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:14:37,765 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:14:37,765 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 -> 6b28fb6889d0d92f72216f98e0edff81bbc7a955814acfd4caad3db76eb7ead3 [2025-01-10 01:14:37,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:14:37,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:14:37,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:14:37,987 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:14:37,987 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:14:37,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-cond-4.wvr.c [2025-01-10 01:14:39,083 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/69f9875af/b4d1c2db0f434af893d59cc880d02e72/FLAG79b400098 [2025-01-10 01:14:39,351 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:14:39,352 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-4.wvr.c [2025-01-10 01:14:39,361 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/69f9875af/b4d1c2db0f434af893d59cc880d02e72/FLAG79b400098 [2025-01-10 01:14:39,670 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/69f9875af/b4d1c2db0f434af893d59cc880d02e72 [2025-01-10 01:14:39,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:14:39,673 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:14:39,674 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:14:39,675 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:14:39,678 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:14:39,678 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:14:39" (1/1) ... [2025-01-10 01:14:39,679 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49efd45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:39, skipping insertion in model container [2025-01-10 01:14:39,680 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:14:39" (1/1) ... [2025-01-10 01:14:39,689 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:14:39,815 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:14:39,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:14:39,828 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:14:39,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:14:39,864 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:14:39,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:39 WrapperNode [2025-01-10 01:14:39,866 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:14:39,867 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:14:39,867 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:14:39,867 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:14:39,877 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:14:39" (1/1) ... [2025-01-10 01:14:39,882 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:14:39" (1/1) ... [2025-01-10 01:14:39,902 INFO L138 Inliner]: procedures = 23, calls = 32, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 169 [2025-01-10 01:14:39,906 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:14:39,906 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:14:39,906 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:14:39,906 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:14:39,913 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:39" (1/1) ... [2025-01-10 01:14:39,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:39" (1/1) ... [2025-01-10 01:14:39,918 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:39" (1/1) ... [2025-01-10 01:14:39,935 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-10 01:14:39,938 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:39" (1/1) ... [2025-01-10 01:14:39,939 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:39" (1/1) ... [2025-01-10 01:14:39,943 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:39" (1/1) ... [2025-01-10 01:14:39,943 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:39" (1/1) ... [2025-01-10 01:14:39,945 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:39" (1/1) ... [2025-01-10 01:14:39,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:39" (1/1) ... [2025-01-10 01:14:39,947 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:39" (1/1) ... [2025-01-10 01:14:39,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:14:39,950 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:14:39,950 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:14:39,950 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:14:39,950 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:39" (1/1) ... [2025-01-10 01:14:39,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:14:39,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:39,973 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:14:39,976 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:14:39,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:14:39,991 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:14:39,991 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:14:39,991 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:14:39,991 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:14:39,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:14:39,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:14:39,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:14:39,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:14:39,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:14:39,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:14:39,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:14:39,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:14:39,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:14:39,992 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:14:40,057 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:14:40,058 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:14:40,291 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:14:40,291 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:14:40,476 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:14:40,476 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:14:40,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:14:40 BoogieIcfgContainer [2025-01-10 01:14:40,476 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:14:40,482 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:14:40,482 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:14:40,486 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:14:40,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:14:39" (1/3) ... [2025-01-10 01:14:40,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1691a36e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:14:40, skipping insertion in model container [2025-01-10 01:14:40,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:39" (2/3) ... [2025-01-10 01:14:40,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1691a36e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:14:40, skipping insertion in model container [2025-01-10 01:14:40,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:14:40" (3/3) ... [2025-01-10 01:14:40,487 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-cond-4.wvr.c [2025-01-10 01:14:40,497 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:14:40,499 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-cond-4.wvr.c that has 3 procedures, 51 locations, 1 initial locations, 3 loop locations, and 20 error locations. [2025-01-10 01:14:40,499 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:14:40,547 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 01:14:40,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 56 transitions, 126 flow [2025-01-10 01:14:40,591 INFO L124 PetriNetUnfolderBase]: 6/54 cut-off events. [2025-01-10 01:14:40,592 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:14:40,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 54 events. 6/54 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 147 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-01-10 01:14:40,594 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 56 transitions, 126 flow [2025-01-10 01:14:40,596 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 53 transitions, 118 flow [2025-01-10 01:14:40,600 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:14:40,607 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;@72b9df48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:14:40,607 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-01-10 01:14:40,609 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:14:40,609 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:14:40,609 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:14:40,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:40,610 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:14:40,610 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 01:14:40,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:40,613 INFO L85 PathProgramCache]: Analyzing trace with hash 580207, now seen corresponding path program 1 times [2025-01-10 01:14:40,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:40,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619596523] [2025-01-10 01:14:40,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:40,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:40,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:14:40,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:14:40,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:40,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:40,792 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:14:40,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:40,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619596523] [2025-01-10 01:14:40,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619596523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:40,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:40,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:14:40,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087458883] [2025-01-10 01:14:40,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:40,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:14:40,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:40,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:14:40,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:14:40,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 56 [2025-01-10 01:14:40,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:40,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:40,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 56 [2025-01-10 01:14:40,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:40,975 INFO L124 PetriNetUnfolderBase]: 192/426 cut-off events. [2025-01-10 01:14:40,975 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-01-10 01:14:40,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 426 events. 192/426 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2247 event pairs, 120 based on Foata normal form. 1/333 useless extension candidates. Maximal degree in co-relation 654. Up to 298 conditions per place. [2025-01-10 01:14:40,982 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 26 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2025-01-10 01:14:40,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 168 flow [2025-01-10 01:14:40,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:14:40,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:14:40,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-01-10 01:14:40,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-01-10 01:14:40,994 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 118 flow. Second operand 3 states and 105 transitions. [2025-01-10 01:14:40,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 168 flow [2025-01-10 01:14:40,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 160 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:14:40,998 INFO L231 Difference]: Finished difference. Result has 49 places, 50 transitions, 108 flow [2025-01-10 01:14:41,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=49, PETRI_TRANSITIONS=50} [2025-01-10 01:14:41,002 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -5 predicate places. [2025-01-10 01:14:41,002 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 50 transitions, 108 flow [2025-01-10 01:14:41,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:41,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:41,003 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:14:41,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:14:41,003 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 01:14:41,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:41,003 INFO L85 PathProgramCache]: Analyzing trace with hash 580208, now seen corresponding path program 1 times [2025-01-10 01:14:41,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:41,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134737025] [2025-01-10 01:14:41,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:41,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:41,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:14:41,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:14:41,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:41,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:41,225 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:14:41,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:41,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134737025] [2025-01-10 01:14:41,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134737025] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:41,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:41,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:14:41,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286771434] [2025-01-10 01:14:41,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:41,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:14:41,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:41,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:14:41,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:14:41,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 56 [2025-01-10 01:14:41,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 50 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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:41,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:41,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 56 [2025-01-10 01:14:41,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:41,384 INFO L124 PetriNetUnfolderBase]: 193/429 cut-off events. [2025-01-10 01:14:41,385 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 01:14:41,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 744 conditions, 429 events. 193/429 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2261 event pairs, 120 based on Foata normal form. 0/335 useless extension candidates. Maximal degree in co-relation 722. Up to 303 conditions per place. [2025-01-10 01:14:41,388 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 29 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2025-01-10 01:14:41,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 180 flow [2025-01-10 01:14:41,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:14:41,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:14:41,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2025-01-10 01:14:41,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-01-10 01:14:41,390 INFO L175 Difference]: Start difference. First operand has 49 places, 50 transitions, 108 flow. Second operand 3 states and 108 transitions. [2025-01-10 01:14:41,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 53 transitions, 180 flow [2025-01-10 01:14:41,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 53 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:14:41,392 INFO L231 Difference]: Finished difference. Result has 50 places, 52 transitions, 123 flow [2025-01-10 01:14:41,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=50, PETRI_TRANSITIONS=52} [2025-01-10 01:14:41,393 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2025-01-10 01:14:41,393 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 52 transitions, 123 flow [2025-01-10 01:14:41,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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:41,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:41,394 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:14:41,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:14:41,394 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 01:14:41,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:41,395 INFO L85 PathProgramCache]: Analyzing trace with hash 557597911, now seen corresponding path program 1 times [2025-01-10 01:14:41,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:41,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460303842] [2025-01-10 01:14:41,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:41,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:41,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:14:41,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:14:41,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:41,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:41,612 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:14:41,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:41,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460303842] [2025-01-10 01:14:41,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460303842] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:41,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747413649] [2025-01-10 01:14:41,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:41,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:41,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:41,621 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:14:41,622 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:14:41,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:14:41,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:14:41,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:41,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:41,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 01:14:41,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:41,737 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:14:41,896 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:14:41,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:41,972 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:14:41,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747413649] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:41,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:41,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:14:41,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406560860] [2025-01-10 01:14:41,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:41,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:14:41,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:41,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:14:41,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:14:42,128 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 56 [2025-01-10 01:14:42,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 52 transitions, 123 flow. Second operand has 11 states, 11 states have (on average 26.363636363636363) internal successors, (290), 11 states have internal predecessors, (290), 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:42,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:42,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 56 [2025-01-10 01:14:42,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:42,355 INFO L124 PetriNetUnfolderBase]: 194/431 cut-off events. [2025-01-10 01:14:42,355 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 01:14:42,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 431 events. 194/431 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2270 event pairs, 120 based on Foata normal form. 0/338 useless extension candidates. Maximal degree in co-relation 722. Up to 300 conditions per place. [2025-01-10 01:14:42,362 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 25 selfloop transitions, 9 changer transitions 0/55 dead transitions. [2025-01-10 01:14:42,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 55 transitions, 199 flow [2025-01-10 01:14:42,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:14:42,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:14:42,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 211 transitions. [2025-01-10 01:14:42,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5382653061224489 [2025-01-10 01:14:42,363 INFO L175 Difference]: Start difference. First operand has 50 places, 52 transitions, 123 flow. Second operand 7 states and 211 transitions. [2025-01-10 01:14:42,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 55 transitions, 199 flow [2025-01-10 01:14:42,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 55 transitions, 196 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:14:42,365 INFO L231 Difference]: Finished difference. Result has 54 places, 55 transitions, 148 flow [2025-01-10 01:14:42,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=148, PETRI_PLACES=54, PETRI_TRANSITIONS=55} [2025-01-10 01:14:42,366 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2025-01-10 01:14:42,366 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 55 transitions, 148 flow [2025-01-10 01:14:42,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 26.363636363636363) internal successors, (290), 11 states have internal predecessors, (290), 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:42,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:42,366 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:14:42,375 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:14:42,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:42,571 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 01:14:42,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:42,572 INFO L85 PathProgramCache]: Analyzing trace with hash 108098407, now seen corresponding path program 1 times [2025-01-10 01:14:42,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:42,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124233364] [2025-01-10 01:14:42,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:42,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:42,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:14:42,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:14:42,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:42,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:42,628 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:14:42,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:42,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124233364] [2025-01-10 01:14:42,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124233364] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:42,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:42,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:14:42,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971243680] [2025-01-10 01:14:42,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:42,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:14:42,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:42,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:14:42,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:14:42,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 56 [2025-01-10 01:14:42,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 55 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:42,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:42,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 56 [2025-01-10 01:14:42,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:42,717 INFO L124 PetriNetUnfolderBase]: 193/430 cut-off events. [2025-01-10 01:14:42,717 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 01:14:42,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 430 events. 193/430 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2246 event pairs, 120 based on Foata normal form. 1/338 useless extension candidates. Maximal degree in co-relation 722. Up to 304 conditions per place. [2025-01-10 01:14:42,720 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 31 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2025-01-10 01:14:42,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 54 transitions, 208 flow [2025-01-10 01:14:42,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:14:42,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:14:42,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-01-10 01:14:42,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6488095238095238 [2025-01-10 01:14:42,721 INFO L175 Difference]: Start difference. First operand has 54 places, 55 transitions, 148 flow. Second operand 3 states and 109 transitions. [2025-01-10 01:14:42,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 54 transitions, 208 flow [2025-01-10 01:14:42,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 54 transitions, 193 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-01-10 01:14:42,722 INFO L231 Difference]: Finished difference. Result has 53 places, 54 transitions, 131 flow [2025-01-10 01:14:42,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=53, PETRI_TRANSITIONS=54} [2025-01-10 01:14:42,723 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -1 predicate places. [2025-01-10 01:14:42,723 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 54 transitions, 131 flow [2025-01-10 01:14:42,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:42,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:42,723 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:42,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:14:42,723 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 01:14:42,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:42,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1531143264, now seen corresponding path program 1 times [2025-01-10 01:14:42,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:42,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882485429] [2025-01-10 01:14:42,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:42,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:42,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:14:42,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:14:42,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:42,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:42,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:14:42,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:42,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882485429] [2025-01-10 01:14:42,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882485429] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:42,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306533623] [2025-01-10 01:14:42,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:42,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:42,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:42,959 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:14:42,971 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:14:43,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:14:43,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:14:43,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:43,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:43,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:14:43,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:43,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:14:43,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:43,195 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 29 treesize of output 25 [2025-01-10 01:14:43,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:14:43,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306533623] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:43,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:43,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:14:43,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419465313] [2025-01-10 01:14:43,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:43,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:14:43,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:43,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:14:43,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:14:43,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 56 [2025-01-10 01:14:43,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 54 transitions, 131 flow. Second operand has 11 states, 11 states have (on average 27.181818181818183) internal successors, (299), 11 states have internal predecessors, (299), 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:43,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:43,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 56 [2025-01-10 01:14:43,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:43,682 INFO L124 PetriNetUnfolderBase]: 405/792 cut-off events. [2025-01-10 01:14:43,682 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 01:14:43,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1449 conditions, 792 events. 405/792 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4431 event pairs, 129 based on Foata normal form. 0/627 useless extension candidates. Maximal degree in co-relation 1435. Up to 357 conditions per place. [2025-01-10 01:14:43,692 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 51 selfloop transitions, 5 changer transitions 0/76 dead transitions. [2025-01-10 01:14:43,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 76 transitions, 290 flow [2025-01-10 01:14:43,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:43,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:43,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2025-01-10 01:14:43,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6392857142857142 [2025-01-10 01:14:43,693 INFO L175 Difference]: Start difference. First operand has 53 places, 54 transitions, 131 flow. Second operand 5 states and 179 transitions. [2025-01-10 01:14:43,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 76 transitions, 290 flow [2025-01-10 01:14:43,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 76 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:14:43,695 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 146 flow [2025-01-10 01:14:43,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2025-01-10 01:14:43,695 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2025-01-10 01:14:43,695 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 146 flow [2025-01-10 01:14:43,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 27.181818181818183) internal successors, (299), 11 states have internal predecessors, (299), 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:43,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:43,696 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:43,702 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:14:43,896 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:14:43,896 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 01:14:43,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:43,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1531143265, now seen corresponding path program 1 times [2025-01-10 01:14:43,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:43,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561370982] [2025-01-10 01:14:43,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:43,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:43,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:14:43,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:14:43,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:43,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:43,960 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:14:43,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:43,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561370982] [2025-01-10 01:14:43,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561370982] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:43,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:43,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:14:43,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426235210] [2025-01-10 01:14:43,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:43,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:14:43,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:43,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:14:43,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:14:44,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 56 [2025-01-10 01:14:44,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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:44,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:44,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 56 [2025-01-10 01:14:44,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:44,068 INFO L124 PetriNetUnfolderBase]: 364/689 cut-off events. [2025-01-10 01:14:44,068 INFO L125 PetriNetUnfolderBase]: For 51/63 co-relation queries the response was YES. [2025-01-10 01:14:44,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1365 conditions, 689 events. 364/689 cut-off events. For 51/63 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3554 event pairs, 246 based on Foata normal form. 53/652 useless extension candidates. Maximal degree in co-relation 620. Up to 554 conditions per place. [2025-01-10 01:14:44,071 INFO L140 encePairwiseOnDemand]: 46/56 looper letters, 31 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2025-01-10 01:14:44,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 47 transitions, 198 flow [2025-01-10 01:14:44,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:14:44,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:14:44,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-01-10 01:14:44,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-01-10 01:14:44,072 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 146 flow. Second operand 4 states and 104 transitions. [2025-01-10 01:14:44,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 47 transitions, 198 flow [2025-01-10 01:14:44,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 47 transitions, 191 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:14:44,073 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 129 flow [2025-01-10 01:14:44,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2025-01-10 01:14:44,073 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -6 predicate places. [2025-01-10 01:14:44,073 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 129 flow [2025-01-10 01:14:44,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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:44,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:44,073 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:44,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:14:44,073 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 01:14:44,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:44,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1698235596, now seen corresponding path program 1 times [2025-01-10 01:14:44,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:44,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946596198] [2025-01-10 01:14:44,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:44,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:44,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:14:44,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:14:44,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:44,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:44,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:14:44,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:44,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946596198] [2025-01-10 01:14:44,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946596198] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:44,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140138046] [2025-01-10 01:14:44,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:44,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:44,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:44,279 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:14:44,285 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:14:44,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:14:44,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:14:44,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:44,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:44,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:14:44,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:44,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:14:44,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:44,494 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 29 treesize of output 25 [2025-01-10 01:14:44,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:14:44,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140138046] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:44,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:44,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:14:44,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397224776] [2025-01-10 01:14:44,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:44,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:14:44,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:44,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:14:44,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:14:44,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-01-10 01:14:44,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 129 flow. Second operand has 11 states, 11 states have (on average 21.727272727272727) internal successors, (239), 11 states have internal predecessors, (239), 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:44,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:44,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-01-10 01:14:44,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:44,909 INFO L124 PetriNetUnfolderBase]: 711/1206 cut-off events. [2025-01-10 01:14:44,909 INFO L125 PetriNetUnfolderBase]: For 133/171 co-relation queries the response was YES. [2025-01-10 01:14:44,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2460 conditions, 1206 events. 711/1206 cut-off events. For 133/171 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5831 event pairs, 144 based on Foata normal form. 0/949 useless extension candidates. Maximal degree in co-relation 2426. Up to 810 conditions per place. [2025-01-10 01:14:44,915 INFO L140 encePairwiseOnDemand]: 45/56 looper letters, 51 selfloop transitions, 8 changer transitions 0/65 dead transitions. [2025-01-10 01:14:44,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 289 flow [2025-01-10 01:14:44,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:44,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:44,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2025-01-10 01:14:44,916 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5464285714285714 [2025-01-10 01:14:44,916 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 129 flow. Second operand 5 states and 153 transitions. [2025-01-10 01:14:44,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 289 flow [2025-01-10 01:14:44,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 285 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:14:44,918 INFO L231 Difference]: Finished difference. Result has 51 places, 51 transitions, 171 flow [2025-01-10 01:14:44,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=51, PETRI_TRANSITIONS=51} [2025-01-10 01:14:44,918 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2025-01-10 01:14:44,918 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 51 transitions, 171 flow [2025-01-10 01:14:44,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 21.727272727272727) internal successors, (239), 11 states have internal predecessors, (239), 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:44,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:44,918 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:44,925 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:45,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:45,119 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 01:14:45,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:45,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1745125475, now seen corresponding path program 1 times [2025-01-10 01:14:45,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:45,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642942850] [2025-01-10 01:14:45,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:45,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:45,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:14:45,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:14:45,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:45,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:45,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:14:45,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:45,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642942850] [2025-01-10 01:14:45,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642942850] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:45,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133219019] [2025-01-10 01:14:45,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:45,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:45,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:45,278 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:45,280 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:45,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:14:45,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:14:45,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:45,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:45,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:14:45,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:45,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:14:45,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:45,466 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 36 treesize of output 32 [2025-01-10 01:14:45,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:14:45,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133219019] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:45,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:45,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-01-10 01:14:45,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952624163] [2025-01-10 01:14:45,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:45,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:14:45,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:45,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:14:45,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:14:46,128 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 56 [2025-01-10 01:14:46,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 51 transitions, 171 flow. Second operand has 17 states, 17 states have (on average 26.764705882352942) internal successors, (455), 17 states have internal predecessors, (455), 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:46,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:46,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 56 [2025-01-10 01:14:46,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:46,588 INFO L124 PetriNetUnfolderBase]: 1164/2169 cut-off events. [2025-01-10 01:14:46,588 INFO L125 PetriNetUnfolderBase]: For 261/261 co-relation queries the response was YES. [2025-01-10 01:14:46,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4716 conditions, 2169 events. 1164/2169 cut-off events. For 261/261 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13506 event pairs, 564 based on Foata normal form. 0/1906 useless extension candidates. Maximal degree in co-relation 2493. Up to 935 conditions per place. [2025-01-10 01:14:46,596 INFO L140 encePairwiseOnDemand]: 45/56 looper letters, 99 selfloop transitions, 14 changer transitions 0/125 dead transitions. [2025-01-10 01:14:46,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 125 transitions, 613 flow [2025-01-10 01:14:46,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:14:46,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:14:46,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 300 transitions. [2025-01-10 01:14:46,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6696428571428571 [2025-01-10 01:14:46,598 INFO L175 Difference]: Start difference. First operand has 51 places, 51 transitions, 171 flow. Second operand 8 states and 300 transitions. [2025-01-10 01:14:46,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 125 transitions, 613 flow [2025-01-10 01:14:46,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 125 transitions, 591 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:14:46,600 INFO L231 Difference]: Finished difference. Result has 58 places, 59 transitions, 252 flow [2025-01-10 01:14:46,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=252, PETRI_PLACES=58, PETRI_TRANSITIONS=59} [2025-01-10 01:14:46,600 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2025-01-10 01:14:46,600 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 59 transitions, 252 flow [2025-01-10 01:14:46,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 26.764705882352942) internal successors, (455), 17 states have internal predecessors, (455), 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:46,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:46,601 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:46,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 01:14:46,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-10 01:14:46,805 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 01:14:46,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:46,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1105696557, now seen corresponding path program 1 times [2025-01-10 01:14:46,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:46,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943499281] [2025-01-10 01:14:46,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:46,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:46,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:14:46,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:14:46,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:46,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:14:46,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:46,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943499281] [2025-01-10 01:14:46,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943499281] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:46,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695737345] [2025-01-10 01:14:46,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:46,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:46,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:46,959 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:14:46,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:14:46,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:14:47,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:14:47,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:47,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:47,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:14:47,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:47,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:14:47,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:47,129 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 29 treesize of output 25 [2025-01-10 01:14:47,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:14:47,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695737345] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:47,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:47,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-01-10 01:14:47,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623786810] [2025-01-10 01:14:47,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:47,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:14:47,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:47,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:14:47,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:14:47,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-01-10 01:14:47,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 59 transitions, 252 flow. Second operand has 14 states, 14 states have (on average 21.357142857142858) internal successors, (299), 14 states have internal predecessors, (299), 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:47,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:47,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-01-10 01:14:47,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:47,724 INFO L124 PetriNetUnfolderBase]: 1488/2506 cut-off events. [2025-01-10 01:14:47,724 INFO L125 PetriNetUnfolderBase]: For 1624/1700 co-relation queries the response was YES. [2025-01-10 01:14:47,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6313 conditions, 2506 events. 1488/2506 cut-off events. For 1624/1700 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 13792 event pairs, 633 based on Foata normal form. 0/2224 useless extension candidates. Maximal degree in co-relation 3839. Up to 1912 conditions per place. [2025-01-10 01:14:47,732 INFO L140 encePairwiseOnDemand]: 43/56 looper letters, 79 selfloop transitions, 15 changer transitions 0/100 dead transitions. [2025-01-10 01:14:47,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 100 transitions, 565 flow [2025-01-10 01:14:47,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:14:47,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:14:47,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 220 transitions. [2025-01-10 01:14:47,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5612244897959183 [2025-01-10 01:14:47,734 INFO L175 Difference]: Start difference. First operand has 58 places, 59 transitions, 252 flow. Second operand 7 states and 220 transitions. [2025-01-10 01:14:47,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 100 transitions, 565 flow [2025-01-10 01:14:47,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 100 transitions, 558 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:14:47,737 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 315 flow [2025-01-10 01:14:47,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=315, PETRI_PLACES=62, PETRI_TRANSITIONS=63} [2025-01-10 01:14:47,737 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 8 predicate places. [2025-01-10 01:14:47,737 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 315 flow [2025-01-10 01:14:47,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 21.357142857142858) internal successors, (299), 14 states have internal predecessors, (299), 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:47,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:47,738 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:47,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 01:14:47,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:47,942 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 01:14:47,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:47,942 INFO L85 PathProgramCache]: Analyzing trace with hash 530506780, now seen corresponding path program 2 times [2025-01-10 01:14:47,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:47,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738825355] [2025-01-10 01:14:47,942 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:47,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:47,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-01-10 01:14:47,959 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-01-10 01:14:47,959 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:47,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:48,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:14:48,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:48,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738825355] [2025-01-10 01:14:48,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738825355] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:48,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769267719] [2025-01-10 01:14:48,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:48,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:48,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:48,119 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:14:48,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:14:48,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-01-10 01:14:48,166 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-01-10 01:14:48,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:48,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:48,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 01:14:48,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:48,179 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:48,296 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:14:48,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:48,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:14:48,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769267719] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:48,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:48,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:14:48,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057027266] [2025-01-10 01:14:48,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:48,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:14:48,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:48,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:14:48,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:14:48,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 56 [2025-01-10 01:14:48,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 315 flow. Second operand has 11 states, 11 states have (on average 27.727272727272727) internal successors, (305), 11 states have internal predecessors, (305), 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:48,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:48,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 56 [2025-01-10 01:14:48,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:48,926 INFO L124 PetriNetUnfolderBase]: 1142/2090 cut-off events. [2025-01-10 01:14:48,926 INFO L125 PetriNetUnfolderBase]: For 1291/1291 co-relation queries the response was YES. [2025-01-10 01:14:48,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5364 conditions, 2090 events. 1142/2090 cut-off events. For 1291/1291 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12657 event pairs, 579 based on Foata normal form. 0/2026 useless extension candidates. Maximal degree in co-relation 3399. Up to 1321 conditions per place. [2025-01-10 01:14:48,934 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 68 selfloop transitions, 10 changer transitions 0/90 dead transitions. [2025-01-10 01:14:48,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 90 transitions, 611 flow [2025-01-10 01:14:48,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:48,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:48,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2025-01-10 01:14:48,936 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2025-01-10 01:14:48,936 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 315 flow. Second operand 5 states and 170 transitions. [2025-01-10 01:14:48,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 90 transitions, 611 flow [2025-01-10 01:14:48,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 90 transitions, 576 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 01:14:48,940 INFO L231 Difference]: Finished difference. Result has 60 places, 62 transitions, 305 flow [2025-01-10 01:14:48,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=305, PETRI_PLACES=60, PETRI_TRANSITIONS=62} [2025-01-10 01:14:48,941 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 6 predicate places. [2025-01-10 01:14:48,941 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 62 transitions, 305 flow [2025-01-10 01:14:48,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 27.727272727272727) internal successors, (305), 11 states have internal predecessors, (305), 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:48,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:48,941 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:48,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 01:14:49,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 01:14:49,142 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 01:14:49,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:49,142 INFO L85 PathProgramCache]: Analyzing trace with hash 2107222676, now seen corresponding path program 2 times [2025-01-10 01:14:49,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:49,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125606838] [2025-01-10 01:14:49,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:49,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:49,158 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-01-10 01:14:49,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 13 statements. [2025-01-10 01:14:49,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:49,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:49,293 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:49,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:49,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125606838] [2025-01-10 01:14:49,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125606838] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:49,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:49,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:14:49,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421789814] [2025-01-10 01:14:49,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:49,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:14:49,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:49,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:14:49,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:14:49,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-01-10 01:14:49,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 62 transitions, 305 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:49,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:49,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-01-10 01:14:49,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:49,546 INFO L124 PetriNetUnfolderBase]: 1349/2256 cut-off events. [2025-01-10 01:14:49,546 INFO L125 PetriNetUnfolderBase]: For 2708/2708 co-relation queries the response was YES. [2025-01-10 01:14:49,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6263 conditions, 2256 events. 1349/2256 cut-off events. For 2708/2708 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 12173 event pairs, 808 based on Foata normal form. 64/2119 useless extension candidates. Maximal degree in co-relation 3814. Up to 1716 conditions per place. [2025-01-10 01:14:49,554 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 56 selfloop transitions, 8 changer transitions 0/69 dead transitions. [2025-01-10 01:14:49,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 69 transitions, 480 flow [2025-01-10 01:14:49,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:49,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:49,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2025-01-10 01:14:49,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2025-01-10 01:14:49,555 INFO L175 Difference]: Start difference. First operand has 60 places, 62 transitions, 305 flow. Second operand 5 states and 136 transitions. [2025-01-10 01:14:49,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 69 transitions, 480 flow [2025-01-10 01:14:49,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 69 transitions, 448 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:14:49,558 INFO L231 Difference]: Finished difference. Result has 57 places, 59 transitions, 289 flow [2025-01-10 01:14:49,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=289, PETRI_PLACES=57, PETRI_TRANSITIONS=59} [2025-01-10 01:14:49,558 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2025-01-10 01:14:49,558 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 59 transitions, 289 flow [2025-01-10 01:14:49,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:49,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:49,559 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:49,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:14:49,559 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 01:14:49,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:49,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1716473463, now seen corresponding path program 1 times [2025-01-10 01:14:49,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:49,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257130733] [2025-01-10 01:14:49,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:49,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:49,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:14:49,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:14:49,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:49,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:49,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:14:49,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:49,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257130733] [2025-01-10 01:14:49,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257130733] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:49,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686494394] [2025-01-10 01:14:49,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:49,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:49,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:49,682 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:14:49,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:14:49,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:14:49,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:14:49,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:49,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:49,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:14:49,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:49,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:14:49,821 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:49,869 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 36 treesize of output 32 [2025-01-10 01:14:49,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:14:49,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686494394] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:49,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:49,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-01-10 01:14:49,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266795055] [2025-01-10 01:14:49,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:49,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:14:49,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:49,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:14:49,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:14:50,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-01-10 01:14:50,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 59 transitions, 289 flow. Second operand has 17 states, 17 states have (on average 21.11764705882353) internal successors, (359), 17 states have internal predecessors, (359), 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:50,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:50,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-01-10 01:14:50,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:50,738 INFO L124 PetriNetUnfolderBase]: 1258/2102 cut-off events. [2025-01-10 01:14:50,738 INFO L125 PetriNetUnfolderBase]: For 1758/1758 co-relation queries the response was YES. [2025-01-10 01:14:50,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5521 conditions, 2102 events. 1258/2102 cut-off events. For 1758/1758 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 11089 event pairs, 605 based on Foata normal form. 16/2007 useless extension candidates. Maximal degree in co-relation 3606. Up to 986 conditions per place. [2025-01-10 01:14:50,747 INFO L140 encePairwiseOnDemand]: 38/56 looper letters, 85 selfloop transitions, 23 changer transitions 0/113 dead transitions. [2025-01-10 01:14:50,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 113 transitions, 664 flow [2025-01-10 01:14:50,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:14:50,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:14:50,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 250 transitions. [2025-01-10 01:14:50,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5580357142857143 [2025-01-10 01:14:50,749 INFO L175 Difference]: Start difference. First operand has 57 places, 59 transitions, 289 flow. Second operand 8 states and 250 transitions. [2025-01-10 01:14:50,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 113 transitions, 664 flow [2025-01-10 01:14:50,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 113 transitions, 642 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:14:50,753 INFO L231 Difference]: Finished difference. Result has 62 places, 67 transitions, 396 flow [2025-01-10 01:14:50,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=396, PETRI_PLACES=62, PETRI_TRANSITIONS=67} [2025-01-10 01:14:50,755 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 8 predicate places. [2025-01-10 01:14:50,755 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 67 transitions, 396 flow [2025-01-10 01:14:50,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 21.11764705882353) internal successors, (359), 17 states have internal predecessors, (359), 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:50,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:50,755 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:50,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 01:14:50,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:50,958 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 01:14:50,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:50,958 INFO L85 PathProgramCache]: Analyzing trace with hash 2110399518, now seen corresponding path program 2 times [2025-01-10 01:14:50,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:50,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145184371] [2025-01-10 01:14:50,958 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:50,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:50,964 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-10 01:14:50,973 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 15 statements. [2025-01-10 01:14:50,975 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:50,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:51,109 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:51,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:51,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145184371] [2025-01-10 01:14:51,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145184371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:51,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:51,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:14:51,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284046097] [2025-01-10 01:14:51,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:51,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:14:51,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:51,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:14:51,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:14:51,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-01-10 01:14:51,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 67 transitions, 396 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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:51,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:51,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-01-10 01:14:51,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:51,350 INFO L124 PetriNetUnfolderBase]: 1113/1881 cut-off events. [2025-01-10 01:14:51,351 INFO L125 PetriNetUnfolderBase]: For 2161/2161 co-relation queries the response was YES. [2025-01-10 01:14:51,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5545 conditions, 1881 events. 1113/1881 cut-off events. For 2161/2161 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10077 event pairs, 297 based on Foata normal form. 16/1813 useless extension candidates. Maximal degree in co-relation 3488. Up to 991 conditions per place. [2025-01-10 01:14:51,360 INFO L140 encePairwiseOnDemand]: 42/56 looper letters, 40 selfloop transitions, 29 changer transitions 0/74 dead transitions. [2025-01-10 01:14:51,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 74 transitions, 570 flow [2025-01-10 01:14:51,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:51,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:51,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2025-01-10 01:14:51,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.475 [2025-01-10 01:14:51,361 INFO L175 Difference]: Start difference. First operand has 62 places, 67 transitions, 396 flow. Second operand 5 states and 133 transitions. [2025-01-10 01:14:51,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 74 transitions, 570 flow [2025-01-10 01:14:51,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 74 transitions, 552 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 01:14:51,367 INFO L231 Difference]: Finished difference. Result has 57 places, 63 transitions, 413 flow [2025-01-10 01:14:51,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=413, PETRI_PLACES=57, PETRI_TRANSITIONS=63} [2025-01-10 01:14:51,368 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2025-01-10 01:14:51,368 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 63 transitions, 413 flow [2025-01-10 01:14:51,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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:51,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:51,368 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] [2025-01-10 01:14:51,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:14:51,368 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 01:14:51,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:51,369 INFO L85 PathProgramCache]: Analyzing trace with hash 218459687, now seen corresponding path program 1 times [2025-01-10 01:14:51,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:51,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837612205] [2025-01-10 01:14:51,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:51,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:51,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:14:51,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:14:51,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:51,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:51,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:51,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:51,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837612205] [2025-01-10 01:14:51,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837612205] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:51,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:51,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:14:51,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835211121] [2025-01-10 01:14:51,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:51,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:14:51,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:51,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:14:51,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:14:51,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 56 [2025-01-10 01:14:51,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 63 transitions, 413 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:51,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:51,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 56 [2025-01-10 01:14:51,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:51,536 INFO L124 PetriNetUnfolderBase]: 1120/1896 cut-off events. [2025-01-10 01:14:51,537 INFO L125 PetriNetUnfolderBase]: For 2925/2925 co-relation queries the response was YES. [2025-01-10 01:14:51,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5993 conditions, 1896 events. 1120/1896 cut-off events. For 2925/2925 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10039 event pairs, 275 based on Foata normal form. 2/1834 useless extension candidates. Maximal degree in co-relation 3820. Up to 1428 conditions per place. [2025-01-10 01:14:51,544 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 65 selfloop transitions, 11 changer transitions 1/82 dead transitions. [2025-01-10 01:14:51,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 82 transitions, 658 flow [2025-01-10 01:14:51,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:14:51,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:14:51,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2025-01-10 01:14:51,544 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-01-10 01:14:51,544 INFO L175 Difference]: Start difference. First operand has 57 places, 63 transitions, 413 flow. Second operand 3 states and 126 transitions. [2025-01-10 01:14:51,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 82 transitions, 658 flow [2025-01-10 01:14:51,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 82 transitions, 586 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:14:51,549 INFO L231 Difference]: Finished difference. Result has 56 places, 68 transitions, 436 flow [2025-01-10 01:14:51,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=436, PETRI_PLACES=56, PETRI_TRANSITIONS=68} [2025-01-10 01:14:51,549 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2025-01-10 01:14:51,549 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 68 transitions, 436 flow [2025-01-10 01:14:51,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:51,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:51,549 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] [2025-01-10 01:14:51,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:14:51,550 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 01:14:51,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:51,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1262804996, now seen corresponding path program 1 times [2025-01-10 01:14:51,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:51,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204955810] [2025-01-10 01:14:51,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:51,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:51,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:14:51,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:14:51,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:51,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:51,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:51,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:51,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204955810] [2025-01-10 01:14:51,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204955810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:51,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:51,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:14:51,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320484433] [2025-01-10 01:14:51,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:51,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:14:51,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:51,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:14:51,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:14:51,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 56 [2025-01-10 01:14:51,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 68 transitions, 436 flow. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 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:51,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:51,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 56 [2025-01-10 01:14:51,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:52,068 INFO L124 PetriNetUnfolderBase]: 1320/2188 cut-off events. [2025-01-10 01:14:52,068 INFO L125 PetriNetUnfolderBase]: For 2890/2890 co-relation queries the response was YES. [2025-01-10 01:14:52,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6675 conditions, 2188 events. 1320/2188 cut-off events. For 2890/2890 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 11871 event pairs, 457 based on Foata normal form. 18/2206 useless extension candidates. Maximal degree in co-relation 4323. Up to 1198 conditions per place. [2025-01-10 01:14:52,076 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 137 selfloop transitions, 9 changer transitions 0/148 dead transitions. [2025-01-10 01:14:52,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 148 transitions, 1217 flow [2025-01-10 01:14:52,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:52,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 195 transitions. [2025-01-10 01:14:52,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6964285714285714 [2025-01-10 01:14:52,078 INFO L175 Difference]: Start difference. First operand has 56 places, 68 transitions, 436 flow. Second operand 5 states and 195 transitions. [2025-01-10 01:14:52,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 148 transitions, 1217 flow [2025-01-10 01:14:52,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 148 transitions, 1170 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-01-10 01:14:52,084 INFO L231 Difference]: Finished difference. Result has 62 places, 72 transitions, 490 flow [2025-01-10 01:14:52,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=490, PETRI_PLACES=62, PETRI_TRANSITIONS=72} [2025-01-10 01:14:52,084 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 8 predicate places. [2025-01-10 01:14:52,084 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 72 transitions, 490 flow [2025-01-10 01:14:52,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 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:52,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:52,084 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] [2025-01-10 01:14:52,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:14:52,084 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 01:14:52,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:52,085 INFO L85 PathProgramCache]: Analyzing trace with hash 501487592, now seen corresponding path program 2 times [2025-01-10 01:14:52,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:52,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840531770] [2025-01-10 01:14:52,085 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:52,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:52,089 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-01-10 01:14:52,095 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-01-10 01:14:52,095 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:52,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:52,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:52,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:52,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840531770] [2025-01-10 01:14:52,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840531770] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:52,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:52,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:14:52,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128653824] [2025-01-10 01:14:52,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:52,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:14:52,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:52,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:14:52,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:14:52,161 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-01-10 01:14:52,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 72 transitions, 490 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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:52,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:52,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-01-10 01:14:52,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:52,302 INFO L124 PetriNetUnfolderBase]: 1058/1742 cut-off events. [2025-01-10 01:14:52,302 INFO L125 PetriNetUnfolderBase]: For 3064/3064 co-relation queries the response was YES. [2025-01-10 01:14:52,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5819 conditions, 1742 events. 1058/1742 cut-off events. For 3064/3064 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 8260 event pairs, 575 based on Foata normal form. 32/1774 useless extension candidates. Maximal degree in co-relation 3587. Up to 1413 conditions per place. [2025-01-10 01:14:52,310 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 76 selfloop transitions, 12 changer transitions 0/89 dead transitions. [2025-01-10 01:14:52,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 89 transitions, 738 flow [2025-01-10 01:14:52,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:14:52,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:14:52,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2025-01-10 01:14:52,311 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6160714285714286 [2025-01-10 01:14:52,311 INFO L175 Difference]: Start difference. First operand has 62 places, 72 transitions, 490 flow. Second operand 4 states and 138 transitions. [2025-01-10 01:14:52,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 89 transitions, 738 flow [2025-01-10 01:14:52,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 89 transitions, 707 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-01-10 01:14:52,316 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 430 flow [2025-01-10 01:14:52,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=430, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2025-01-10 01:14:52,316 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 11 predicate places. [2025-01-10 01:14:52,316 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 430 flow [2025-01-10 01:14:52,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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:52,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:52,317 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] [2025-01-10 01:14:52,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:14:52,317 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 01:14:52,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:52,317 INFO L85 PathProgramCache]: Analyzing trace with hash 546340544, now seen corresponding path program 1 times [2025-01-10 01:14:52,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:52,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7216980] [2025-01-10 01:14:52,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:52,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:52,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:14:52,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:14:52,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:52,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:52,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:52,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:52,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7216980] [2025-01-10 01:14:52,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7216980] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:52,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:52,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:14:52,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148424155] [2025-01-10 01:14:52,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:52,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:14:52,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:52,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:14:52,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:14:52,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-01-10 01:14:52,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 430 flow. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 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:52,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:52,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-01-10 01:14:52,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:52,681 INFO L124 PetriNetUnfolderBase]: 1244/2068 cut-off events. [2025-01-10 01:14:52,682 INFO L125 PetriNetUnfolderBase]: For 3999/3999 co-relation queries the response was YES. [2025-01-10 01:14:52,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7192 conditions, 2068 events. 1244/2068 cut-off events. For 3999/3999 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10841 event pairs, 373 based on Foata normal form. 32/2100 useless extension candidates. Maximal degree in co-relation 4504. Up to 1018 conditions per place. [2025-01-10 01:14:52,693 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 118 selfloop transitions, 20 changer transitions 0/139 dead transitions. [2025-01-10 01:14:52,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 139 transitions, 1150 flow [2025-01-10 01:14:52,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:14:52,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:14:52,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 219 transitions. [2025-01-10 01:14:52,697 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6517857142857143 [2025-01-10 01:14:52,697 INFO L175 Difference]: Start difference. First operand has 65 places, 65 transitions, 430 flow. Second operand 6 states and 219 transitions. [2025-01-10 01:14:52,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 139 transitions, 1150 flow [2025-01-10 01:14:52,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 139 transitions, 1107 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 01:14:52,712 INFO L231 Difference]: Finished difference. Result has 72 places, 77 transitions, 621 flow [2025-01-10 01:14:52,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=621, PETRI_PLACES=72, PETRI_TRANSITIONS=77} [2025-01-10 01:14:52,713 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 18 predicate places. [2025-01-10 01:14:52,713 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 77 transitions, 621 flow [2025-01-10 01:14:52,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 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:52,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:52,713 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] [2025-01-10 01:14:52,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:14:52,713 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 01:14:52,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:52,714 INFO L85 PathProgramCache]: Analyzing trace with hash -37077878, now seen corresponding path program 2 times [2025-01-10 01:14:52,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:52,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381265730] [2025-01-10 01:14:52,714 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:52,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:52,725 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-01-10 01:14:52,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-01-10 01:14:52,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:52,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:52,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:52,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:52,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381265730] [2025-01-10 01:14:52,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381265730] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:52,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:52,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:14:52,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637601641] [2025-01-10 01:14:52,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:52,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:14:52,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:52,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:14:52,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:14:52,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-01-10 01:14:52,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 77 transitions, 621 flow. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 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:52,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:52,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-01-10 01:14:52,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:52,962 INFO L124 PetriNetUnfolderBase]: 1276/2132 cut-off events. [2025-01-10 01:14:52,962 INFO L125 PetriNetUnfolderBase]: For 5744/5744 co-relation queries the response was YES. [2025-01-10 01:14:52,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8028 conditions, 2132 events. 1276/2132 cut-off events. For 5744/5744 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10780 event pairs, 577 based on Foata normal form. 46/2178 useless extension candidates. Maximal degree in co-relation 5736. Up to 1439 conditions per place. [2025-01-10 01:14:52,970 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 93 selfloop transitions, 22 changer transitions 0/116 dead transitions. [2025-01-10 01:14:52,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 116 transitions, 1127 flow [2025-01-10 01:14:52,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:52,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:52,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2025-01-10 01:14:52,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5964285714285714 [2025-01-10 01:14:52,971 INFO L175 Difference]: Start difference. First operand has 72 places, 77 transitions, 621 flow. Second operand 5 states and 167 transitions. [2025-01-10 01:14:52,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 116 transitions, 1127 flow [2025-01-10 01:14:52,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 116 transitions, 1095 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-01-10 01:14:52,979 INFO L231 Difference]: Finished difference. Result has 77 places, 79 transitions, 686 flow [2025-01-10 01:14:52,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=686, PETRI_PLACES=77, PETRI_TRANSITIONS=79} [2025-01-10 01:14:52,979 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 23 predicate places. [2025-01-10 01:14:52,979 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 79 transitions, 686 flow [2025-01-10 01:14:52,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 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:52,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:52,979 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:52,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 01:14:52,979 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 01:14:52,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:52,980 INFO L85 PathProgramCache]: Analyzing trace with hash -128322871, now seen corresponding path program 1 times [2025-01-10 01:14:52,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:52,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883254648] [2025-01-10 01:14:52,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:52,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:52,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:14:52,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:14:52,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:52,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:53,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:53,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:53,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883254648] [2025-01-10 01:14:53,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883254648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:53,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:53,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:14:53,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330403358] [2025-01-10 01:14:53,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:53,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:14:53,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:53,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:14:53,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:14:53,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-01-10 01:14:53,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 79 transitions, 686 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 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:53,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:53,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-01-10 01:14:53,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:53,320 INFO L124 PetriNetUnfolderBase]: 1596/2688 cut-off events. [2025-01-10 01:14:53,320 INFO L125 PetriNetUnfolderBase]: For 8298/8298 co-relation queries the response was YES. [2025-01-10 01:14:53,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10304 conditions, 2688 events. 1596/2688 cut-off events. For 8298/8298 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 14104 event pairs, 587 based on Foata normal form. 32/2720 useless extension candidates. Maximal degree in co-relation 8953. Up to 1395 conditions per place. [2025-01-10 01:14:53,331 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 118 selfloop transitions, 26 changer transitions 0/145 dead transitions. [2025-01-10 01:14:53,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 145 transitions, 1416 flow [2025-01-10 01:14:53,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:14:53,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:14:53,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 233 transitions. [2025-01-10 01:14:53,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5943877551020408 [2025-01-10 01:14:53,333 INFO L175 Difference]: Start difference. First operand has 77 places, 79 transitions, 686 flow. Second operand 7 states and 233 transitions. [2025-01-10 01:14:53,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 145 transitions, 1416 flow [2025-01-10 01:14:53,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 145 transitions, 1378 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:14:53,344 INFO L231 Difference]: Finished difference. Result has 84 places, 87 transitions, 844 flow [2025-01-10 01:14:53,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=844, PETRI_PLACES=84, PETRI_TRANSITIONS=87} [2025-01-10 01:14:53,344 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 30 predicate places. [2025-01-10 01:14:53,345 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 87 transitions, 844 flow [2025-01-10 01:14:53,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 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:53,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:53,345 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:53,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:14:53,346 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 01:14:53,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:53,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1542598911, now seen corresponding path program 2 times [2025-01-10 01:14:53,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:53,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820046324] [2025-01-10 01:14:53,346 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:53,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:53,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 01:14:53,358 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-01-10 01:14:53,358 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:53,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:53,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:53,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:53,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820046324] [2025-01-10 01:14:53,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820046324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:53,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:53,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:14:53,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982806686] [2025-01-10 01:14:53,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:53,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:14:53,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:53,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:14:53,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:14:53,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-01-10 01:14:53,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 87 transitions, 844 flow. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 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:53,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:53,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-01-10 01:14:53,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:53,710 INFO L124 PetriNetUnfolderBase]: 1568/2612 cut-off events. [2025-01-10 01:14:53,710 INFO L125 PetriNetUnfolderBase]: For 10672/10672 co-relation queries the response was YES. [2025-01-10 01:14:53,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10711 conditions, 2612 events. 1568/2612 cut-off events. For 10672/10672 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13802 event pairs, 589 based on Foata normal form. 6/2618 useless extension candidates. Maximal degree in co-relation 9603. Up to 1318 conditions per place. [2025-01-10 01:14:53,720 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 108 selfloop transitions, 28 changer transitions 0/137 dead transitions. [2025-01-10 01:14:53,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 137 transitions, 1452 flow [2025-01-10 01:14:53,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:53,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 183 transitions. [2025-01-10 01:14:53,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6535714285714286 [2025-01-10 01:14:53,721 INFO L175 Difference]: Start difference. First operand has 84 places, 87 transitions, 844 flow. Second operand 5 states and 183 transitions. [2025-01-10 01:14:53,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 137 transitions, 1452 flow [2025-01-10 01:14:53,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 137 transitions, 1402 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-01-10 01:14:53,735 INFO L231 Difference]: Finished difference. Result has 87 places, 90 transitions, 936 flow [2025-01-10 01:14:53,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=936, PETRI_PLACES=87, PETRI_TRANSITIONS=90} [2025-01-10 01:14:53,735 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 33 predicate places. [2025-01-10 01:14:53,735 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 90 transitions, 936 flow [2025-01-10 01:14:53,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 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:53,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:53,736 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:53,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 01:14:53,736 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 01:14:53,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:53,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1075322709, now seen corresponding path program 3 times [2025-01-10 01:14:53,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:53,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622936342] [2025-01-10 01:14:53,737 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:14:53,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:53,741 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-01-10 01:14:53,746 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-01-10 01:14:53,746 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:14:53,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:53,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:53,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:53,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622936342] [2025-01-10 01:14:53,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622936342] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:53,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:53,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:14:53,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607142228] [2025-01-10 01:14:53,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:53,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:14:53,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:53,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:14:53,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:14:53,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-01-10 01:14:53,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 90 transitions, 936 flow. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 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:53,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:53,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-01-10 01:14:53,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:54,071 INFO L124 PetriNetUnfolderBase]: 1562/2606 cut-off events. [2025-01-10 01:14:54,071 INFO L125 PetriNetUnfolderBase]: For 12888/12888 co-relation queries the response was YES. [2025-01-10 01:14:54,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11039 conditions, 2606 events. 1562/2606 cut-off events. For 12888/12888 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 13366 event pairs, 861 based on Foata normal form. 6/2612 useless extension candidates. Maximal degree in co-relation 10022. Up to 2153 conditions per place. [2025-01-10 01:14:54,080 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 84 selfloop transitions, 35 changer transitions 0/120 dead transitions. [2025-01-10 01:14:54,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 120 transitions, 1447 flow [2025-01-10 01:14:54,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:54,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:54,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2025-01-10 01:14:54,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6035714285714285 [2025-01-10 01:14:54,081 INFO L175 Difference]: Start difference. First operand has 87 places, 90 transitions, 936 flow. Second operand 5 states and 169 transitions. [2025-01-10 01:14:54,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 120 transitions, 1447 flow [2025-01-10 01:14:54,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 120 transitions, 1391 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-01-10 01:14:54,094 INFO L231 Difference]: Finished difference. Result has 92 places, 102 transitions, 1198 flow [2025-01-10 01:14:54,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1198, PETRI_PLACES=92, PETRI_TRANSITIONS=102} [2025-01-10 01:14:54,094 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 38 predicate places. [2025-01-10 01:14:54,094 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 102 transitions, 1198 flow [2025-01-10 01:14:54,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 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:54,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:54,094 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:54,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 01:14:54,094 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 01:14:54,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:54,095 INFO L85 PathProgramCache]: Analyzing trace with hash 825738759, now seen corresponding path program 4 times [2025-01-10 01:14:54,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:54,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572021751] [2025-01-10 01:14:54,095 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:14:54,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:54,100 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-01-10 01:14:54,113 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:14:54,113 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:14:54,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:54,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:54,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:54,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572021751] [2025-01-10 01:14:54,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572021751] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:54,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:54,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 01:14:54,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935448622] [2025-01-10 01:14:54,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:54,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:14:54,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:54,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:14:54,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:14:54,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-01-10 01:14:54,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 102 transitions, 1198 flow. Second operand has 9 states, 9 states have (on average 24.333333333333332) internal successors, (219), 9 states have internal predecessors, (219), 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:54,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:54,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-01-10 01:14:54,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:55,035 INFO L124 PetriNetUnfolderBase]: 1734/2884 cut-off events. [2025-01-10 01:14:55,035 INFO L125 PetriNetUnfolderBase]: For 15112/15112 co-relation queries the response was YES. [2025-01-10 01:14:55,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12330 conditions, 2884 events. 1734/2884 cut-off events. For 15112/15112 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 15088 event pairs, 773 based on Foata normal form. 54/2938 useless extension candidates. Maximal degree in co-relation 11326. Up to 1991 conditions per place. [2025-01-10 01:14:55,046 INFO L140 encePairwiseOnDemand]: 45/56 looper letters, 132 selfloop transitions, 71 changer transitions 0/204 dead transitions. [2025-01-10 01:14:55,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 204 transitions, 2313 flow [2025-01-10 01:14:55,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 01:14:55,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 01:14:55,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 427 transitions. [2025-01-10 01:14:55,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5446428571428571 [2025-01-10 01:14:55,049 INFO L175 Difference]: Start difference. First operand has 92 places, 102 transitions, 1198 flow. Second operand 14 states and 427 transitions. [2025-01-10 01:14:55,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 204 transitions, 2313 flow [2025-01-10 01:14:55,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 204 transitions, 2256 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-01-10 01:14:55,069 INFO L231 Difference]: Finished difference. Result has 113 places, 139 transitions, 1796 flow [2025-01-10 01:14:55,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1108, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1796, PETRI_PLACES=113, PETRI_TRANSITIONS=139} [2025-01-10 01:14:55,069 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 59 predicate places. [2025-01-10 01:14:55,069 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 139 transitions, 1796 flow [2025-01-10 01:14:55,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.333333333333332) internal successors, (219), 9 states have internal predecessors, (219), 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:55,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:55,070 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] [2025-01-10 01:14:55,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 01:14:55,070 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 01:14:55,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:55,070 INFO L85 PathProgramCache]: Analyzing trace with hash 77123796, now seen corresponding path program 1 times [2025-01-10 01:14:55,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:55,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520148155] [2025-01-10 01:14:55,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:55,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:55,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:14:55,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:14:55,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:55,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:55,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:55,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:55,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520148155] [2025-01-10 01:14:55,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520148155] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:55,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:55,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 01:14:55,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263719609] [2025-01-10 01:14:55,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:55,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:14:55,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:55,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:14:55,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:14:55,321 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-01-10 01:14:55,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 139 transitions, 1796 flow. Second operand has 9 states, 9 states have (on average 24.555555555555557) internal successors, (221), 9 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:55,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:55,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-01-10 01:14:55,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:56,065 INFO L124 PetriNetUnfolderBase]: 2760/4625 cut-off events. [2025-01-10 01:14:56,065 INFO L125 PetriNetUnfolderBase]: For 26650/26650 co-relation queries the response was YES. [2025-01-10 01:14:56,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21961 conditions, 4625 events. 2760/4625 cut-off events. For 26650/26650 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 27764 event pairs, 629 based on Foata normal form. 44/4669 useless extension candidates. Maximal degree in co-relation 20122. Up to 1544 conditions per place. [2025-01-10 01:14:56,089 INFO L140 encePairwiseOnDemand]: 46/56 looper letters, 262 selfloop transitions, 80 changer transitions 0/343 dead transitions. [2025-01-10 01:14:56,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 343 transitions, 4208 flow [2025-01-10 01:14:56,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:14:56,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:14:56,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 395 transitions. [2025-01-10 01:14:56,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6412337662337663 [2025-01-10 01:14:56,094 INFO L175 Difference]: Start difference. First operand has 113 places, 139 transitions, 1796 flow. Second operand 11 states and 395 transitions. [2025-01-10 01:14:56,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 343 transitions, 4208 flow [2025-01-10 01:14:56,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 343 transitions, 4074 flow, removed 43 selfloop flow, removed 1 redundant places. [2025-01-10 01:14:56,144 INFO L231 Difference]: Finished difference. Result has 130 places, 186 transitions, 2694 flow [2025-01-10 01:14:56,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1703, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2694, PETRI_PLACES=130, PETRI_TRANSITIONS=186} [2025-01-10 01:14:56,145 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 76 predicate places. [2025-01-10 01:14:56,145 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 186 transitions, 2694 flow [2025-01-10 01:14:56,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.555555555555557) internal successors, (221), 9 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:56,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:56,145 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] [2025-01-10 01:14:56,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 01:14:56,145 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 01:14:56,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:56,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1810881160, now seen corresponding path program 2 times [2025-01-10 01:14:56,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:56,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313014169] [2025-01-10 01:14:56,146 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:56,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:56,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-10 01:14:56,159 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 24 statements. [2025-01-10 01:14:56,159 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:56,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:56,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:14:56,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:56,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313014169] [2025-01-10 01:14:56,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313014169] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:56,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:56,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:14:56,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099510464] [2025-01-10 01:14:56,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:56,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:14:56,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:56,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:14:56,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:14:56,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-01-10 01:14:56,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 186 transitions, 2694 flow. Second operand has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:56,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:56,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-01-10 01:14:56,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:56,797 INFO L124 PetriNetUnfolderBase]: 2682/4539 cut-off events. [2025-01-10 01:14:56,797 INFO L125 PetriNetUnfolderBase]: For 37536/37536 co-relation queries the response was YES. [2025-01-10 01:14:56,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24237 conditions, 4539 events. 2682/4539 cut-off events. For 37536/37536 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 26739 event pairs, 1054 based on Foata normal form. 70/4609 useless extension candidates. Maximal degree in co-relation 22691. Up to 2438 conditions per place. [2025-01-10 01:14:56,826 INFO L140 encePairwiseOnDemand]: 47/56 looper letters, 192 selfloop transitions, 78 changer transitions 0/271 dead transitions. [2025-01-10 01:14:56,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 271 transitions, 4230 flow [2025-01-10 01:14:56,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:14:56,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:14:56,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 227 transitions. [2025-01-10 01:14:56,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5790816326530612 [2025-01-10 01:14:56,828 INFO L175 Difference]: Start difference. First operand has 130 places, 186 transitions, 2694 flow. Second operand 7 states and 227 transitions. [2025-01-10 01:14:56,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 271 transitions, 4230 flow [2025-01-10 01:14:56,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 271 transitions, 4056 flow, removed 87 selfloop flow, removed 0 redundant places. [2025-01-10 01:14:56,897 INFO L231 Difference]: Finished difference. Result has 139 places, 192 transitions, 2927 flow [2025-01-10 01:14:56,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=2612, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2927, PETRI_PLACES=139, PETRI_TRANSITIONS=192} [2025-01-10 01:14:56,898 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 85 predicate places. [2025-01-10 01:14:56,898 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 192 transitions, 2927 flow [2025-01-10 01:14:56,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:56,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:56,898 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] [2025-01-10 01:14:56,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 01:14:56,898 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 01:14:56,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:56,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1917694552, now seen corresponding path program 1 times [2025-01-10 01:14:56,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:56,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839612250] [2025-01-10 01:14:56,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:56,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:56,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:14:56,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:14:56,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:56,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:56,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:56,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:56,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839612250] [2025-01-10 01:14:56,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839612250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:56,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:56,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 01:14:56,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958927532] [2025-01-10 01:14:56,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:56,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:14:56,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:56,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:14:56,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:14:57,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 56 [2025-01-10 01:14:57,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 192 transitions, 2927 flow. Second operand has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 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:57,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:57,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 56 [2025-01-10 01:14:57,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:57,715 INFO L124 PetriNetUnfolderBase]: 2770/4771 cut-off events. [2025-01-10 01:14:57,716 INFO L125 PetriNetUnfolderBase]: For 39790/39822 co-relation queries the response was YES. [2025-01-10 01:14:57,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25562 conditions, 4771 events. 2770/4771 cut-off events. For 39790/39822 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 29942 event pairs, 631 based on Foata normal form. 20/4791 useless extension candidates. Maximal degree in co-relation 23871. Up to 1486 conditions per place. [2025-01-10 01:14:57,792 INFO L140 encePairwiseOnDemand]: 44/56 looper letters, 308 selfloop transitions, 88 changer transitions 0/398 dead transitions. [2025-01-10 01:14:57,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 398 transitions, 5422 flow [2025-01-10 01:14:57,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:14:57,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 01:14:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 434 transitions. [2025-01-10 01:14:57,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2025-01-10 01:14:57,794 INFO L175 Difference]: Start difference. First operand has 139 places, 192 transitions, 2927 flow. Second operand 12 states and 434 transitions. [2025-01-10 01:14:57,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 398 transitions, 5422 flow [2025-01-10 01:14:57,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 398 transitions, 5248 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-01-10 01:14:57,880 INFO L231 Difference]: Finished difference. Result has 154 places, 217 transitions, 3413 flow [2025-01-10 01:14:57,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=2808, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3413, PETRI_PLACES=154, PETRI_TRANSITIONS=217} [2025-01-10 01:14:57,881 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 100 predicate places. [2025-01-10 01:14:57,881 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 217 transitions, 3413 flow [2025-01-10 01:14:57,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 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:57,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:57,881 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] [2025-01-10 01:14:57,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 01:14:57,881 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 01:14:57,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:57,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1175180320, now seen corresponding path program 2 times [2025-01-10 01:14:57,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:57,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821453966] [2025-01-10 01:14:57,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:57,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:57,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-10 01:14:57,894 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:14:57,895 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:14:57,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:58,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:58,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:58,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821453966] [2025-01-10 01:14:58,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821453966] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:58,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635701493] [2025-01-10 01:14:58,008 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:58,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:58,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:58,010 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:14:58,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 01:14:58,045 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-10 01:14:58,062 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:14:58,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:14:58,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:58,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-10 01:14:58,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:58,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 01:14:58,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 01:14:58,209 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:14:58,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:58,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-01-10 01:14:58,416 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 01:14:58,416 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 62 treesize of output 41 [2025-01-10 01:14:58,463 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:14:58,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635701493] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:58,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:58,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-01-10 01:14:58,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488761216] [2025-01-10 01:14:58,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:58,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:14:58,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:58,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:14:58,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:14:59,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-01-10 01:14:59,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 217 transitions, 3413 flow. Second operand has 18 states, 18 states have (on average 25.833333333333332) internal successors, (465), 18 states have internal predecessors, (465), 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:59,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:59,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-01-10 01:14:59,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:01,064 INFO L124 PetriNetUnfolderBase]: 3453/5882 cut-off events. [2025-01-10 01:15:01,064 INFO L125 PetriNetUnfolderBase]: For 55857/55857 co-relation queries the response was YES. [2025-01-10 01:15:01,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32974 conditions, 5882 events. 3453/5882 cut-off events. For 55857/55857 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 35743 event pairs, 396 based on Foata normal form. 22/5904 useless extension candidates. Maximal degree in co-relation 30889. Up to 1021 conditions per place. [2025-01-10 01:15:01,098 INFO L140 encePairwiseOnDemand]: 36/56 looper letters, 246 selfloop transitions, 133 changer transitions 239/619 dead transitions. [2025-01-10 01:15:01,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 619 transitions, 8273 flow [2025-01-10 01:15:01,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-10 01:15:01,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-01-10 01:15:01,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 1123 transitions. [2025-01-10 01:15:01,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6076839826839827 [2025-01-10 01:15:01,100 INFO L175 Difference]: Start difference. First operand has 154 places, 217 transitions, 3413 flow. Second operand 33 states and 1123 transitions. [2025-01-10 01:15:01,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 619 transitions, 8273 flow [2025-01-10 01:15:01,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 619 transitions, 8088 flow, removed 36 selfloop flow, removed 4 redundant places. [2025-01-10 01:15:01,261 INFO L231 Difference]: Finished difference. Result has 195 places, 211 transitions, 3293 flow [2025-01-10 01:15:01,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=3230, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=3293, PETRI_PLACES=195, PETRI_TRANSITIONS=211} [2025-01-10 01:15:01,261 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 141 predicate places. [2025-01-10 01:15:01,261 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 211 transitions, 3293 flow [2025-01-10 01:15:01,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 25.833333333333332) internal successors, (465), 18 states have internal predecessors, (465), 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:15:01,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:01,262 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] [2025-01-10 01:15:01,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 01:15:01,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-10 01:15:01,465 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 01:15:01,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:01,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1486393902, now seen corresponding path program 3 times [2025-01-10 01:15:01,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:01,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408609820] [2025-01-10 01:15:01,466 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:15:01,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:01,470 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-01-10 01:15:01,474 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-01-10 01:15:01,474 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:15:01,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:01,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:15:01,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:01,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408609820] [2025-01-10 01:15:01,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408609820] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:01,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:01,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:15:01,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661629718] [2025-01-10 01:15:01,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:01,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:15:01,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:01,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:15:01,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:15:01,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-01-10 01:15:01,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 211 transitions, 3293 flow. Second operand has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 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:15:01,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:01,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-01-10 01:15:01,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:02,189 INFO L124 PetriNetUnfolderBase]: 2133/3726 cut-off events. [2025-01-10 01:15:02,190 INFO L125 PetriNetUnfolderBase]: For 38046/38046 co-relation queries the response was YES. [2025-01-10 01:15:02,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21690 conditions, 3726 events. 2133/3726 cut-off events. For 38046/38046 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 20985 event pairs, 1026 based on Foata normal form. 32/3758 useless extension candidates. Maximal degree in co-relation 21528. Up to 2525 conditions per place. [2025-01-10 01:15:02,217 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 215 selfloop transitions, 58 changer transitions 0/274 dead transitions. [2025-01-10 01:15:02,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 274 transitions, 4425 flow [2025-01-10 01:15:02,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:15:02,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:15:02,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 244 transitions. [2025-01-10 01:15:02,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6224489795918368 [2025-01-10 01:15:02,221 INFO L175 Difference]: Start difference. First operand has 195 places, 211 transitions, 3293 flow. Second operand 7 states and 244 transitions. [2025-01-10 01:15:02,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 274 transitions, 4425 flow [2025-01-10 01:15:02,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 274 transitions, 3980 flow, removed 184 selfloop flow, removed 17 redundant places. [2025-01-10 01:15:02,332 INFO L231 Difference]: Finished difference. Result has 175 places, 215 transitions, 3091 flow [2025-01-10 01:15:02,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=2894, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3091, PETRI_PLACES=175, PETRI_TRANSITIONS=215} [2025-01-10 01:15:02,333 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 121 predicate places. [2025-01-10 01:15:02,333 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 215 transitions, 3091 flow [2025-01-10 01:15:02,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 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:15:02,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:02,333 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] [2025-01-10 01:15:02,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-10 01:15:02,333 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 01:15:02,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:02,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1091081976, now seen corresponding path program 4 times [2025-01-10 01:15:02,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:02,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998785398] [2025-01-10 01:15:02,334 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:15:02,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:02,340 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-01-10 01:15:02,345 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:15:02,345 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:15:02,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:02,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:02,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:02,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998785398] [2025-01-10 01:15:02,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998785398] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:15:02,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693545338] [2025-01-10 01:15:02,479 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:15:02,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:15:02,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:15:02,480 INFO L229 MonitoredProcess]: Starting monitored process 10 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:15:02,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 01:15:02,527 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-01-10 01:15:02,544 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:15:02,544 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:15:02,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:02,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-10 01:15:02,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:15:02,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 01:15:02,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 01:15:02,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:02,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:15:02,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-01-10 01:15:02,895 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 01:15:02,895 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 62 treesize of output 41 [2025-01-10 01:15:02,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:02,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693545338] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:15:02,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:15:02,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2025-01-10 01:15:02,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264437160] [2025-01-10 01:15:02,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:15:02,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:15:02,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:02,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:15:02,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:15:03,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 56 [2025-01-10 01:15:03,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 215 transitions, 3091 flow. Second operand has 18 states, 18 states have (on average 29.22222222222222) internal successors, (526), 18 states have internal predecessors, (526), 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:15:03,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:03,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 56 [2025-01-10 01:15:03,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:04,088 INFO L124 PetriNetUnfolderBase]: 2274/4106 cut-off events. [2025-01-10 01:15:04,088 INFO L125 PetriNetUnfolderBase]: For 35449/35477 co-relation queries the response was YES. [2025-01-10 01:15:04,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22034 conditions, 4106 events. 2274/4106 cut-off events. For 35449/35477 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 24917 event pairs, 545 based on Foata normal form. 4/4061 useless extension candidates. Maximal degree in co-relation 21659. Up to 2543 conditions per place. [2025-01-10 01:15:04,118 INFO L140 encePairwiseOnDemand]: 41/56 looper letters, 165 selfloop transitions, 64 changer transitions 72/320 dead transitions. [2025-01-10 01:15:04,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 320 transitions, 4723 flow [2025-01-10 01:15:04,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:15:04,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 01:15:04,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 456 transitions. [2025-01-10 01:15:04,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6263736263736264 [2025-01-10 01:15:04,119 INFO L175 Difference]: Start difference. First operand has 175 places, 215 transitions, 3091 flow. Second operand 13 states and 456 transitions. [2025-01-10 01:15:04,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 320 transitions, 4723 flow [2025-01-10 01:15:04,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 320 transitions, 4575 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-01-10 01:15:04,221 INFO L231 Difference]: Finished difference. Result has 185 places, 208 transitions, 2978 flow [2025-01-10 01:15:04,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=2978, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2978, PETRI_PLACES=185, PETRI_TRANSITIONS=208} [2025-01-10 01:15:04,222 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 131 predicate places. [2025-01-10 01:15:04,222 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 208 transitions, 2978 flow [2025-01-10 01:15:04,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 29.22222222222222) internal successors, (526), 18 states have internal predecessors, (526), 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:15:04,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:04,222 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:04,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 01:15:04,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:15:04,426 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 01:15:04,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:04,427 INFO L85 PathProgramCache]: Analyzing trace with hash 758642047, now seen corresponding path program 1 times [2025-01-10 01:15:04,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:04,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148033459] [2025-01-10 01:15:04,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:04,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:04,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 01:15:04,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:15:04,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:04,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:04,677 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:15:04,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:04,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148033459] [2025-01-10 01:15:04,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148033459] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:04,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:04,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 01:15:04,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490892710] [2025-01-10 01:15:04,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:04,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:15:04,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:04,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:15:04,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:15:04,706 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 56 [2025-01-10 01:15:04,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 208 transitions, 2978 flow. Second operand has 9 states, 9 states have (on average 26.444444444444443) internal successors, (238), 9 states have internal predecessors, (238), 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:15:04,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:04,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 56 [2025-01-10 01:15:04,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:05,307 INFO L124 PetriNetUnfolderBase]: 2198/3797 cut-off events. [2025-01-10 01:15:05,307 INFO L125 PetriNetUnfolderBase]: For 33040/33070 co-relation queries the response was YES. [2025-01-10 01:15:05,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20948 conditions, 3797 events. 2198/3797 cut-off events. For 33040/33070 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 21579 event pairs, 1175 based on Foata normal form. 5/3770 useless extension candidates. Maximal degree in co-relation 20878. Up to 3015 conditions per place. [2025-01-10 01:15:05,337 INFO L140 encePairwiseOnDemand]: 47/56 looper letters, 219 selfloop transitions, 39 changer transitions 0/263 dead transitions. [2025-01-10 01:15:05,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 263 transitions, 3891 flow [2025-01-10 01:15:05,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:15:05,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:15:05,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 305 transitions. [2025-01-10 01:15:05,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6051587301587301 [2025-01-10 01:15:05,338 INFO L175 Difference]: Start difference. First operand has 185 places, 208 transitions, 2978 flow. Second operand 9 states and 305 transitions. [2025-01-10 01:15:05,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 263 transitions, 3891 flow [2025-01-10 01:15:05,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 263 transitions, 3668 flow, removed 83 selfloop flow, removed 10 redundant places. [2025-01-10 01:15:05,424 INFO L231 Difference]: Finished difference. Result has 169 places, 210 transitions, 2901 flow [2025-01-10 01:15:05,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=2795, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2901, PETRI_PLACES=169, PETRI_TRANSITIONS=210} [2025-01-10 01:15:05,426 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 115 predicate places. [2025-01-10 01:15:05,426 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 210 transitions, 2901 flow [2025-01-10 01:15:05,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.444444444444443) internal successors, (238), 9 states have internal predecessors, (238), 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:15:05,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:05,427 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:05,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-10 01:15:05,427 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 01:15:05,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:05,427 INFO L85 PathProgramCache]: Analyzing trace with hash 848906849, now seen corresponding path program 2 times [2025-01-10 01:15:05,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:05,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876675763] [2025-01-10 01:15:05,428 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:15:05,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:05,434 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-10 01:15:05,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:15:05,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:15:05,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:05,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:15:05,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:05,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876675763] [2025-01-10 01:15:05,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876675763] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:15:05,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956002781] [2025-01-10 01:15:05,926 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:15:05,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:15:05,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:15:05,932 INFO L229 MonitoredProcess]: Starting monitored process 11 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:15:05,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 01:15:05,969 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-10 01:15:06,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:15:06,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:15:06,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:06,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:15:06,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:15:22,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:15:22,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:15:22,738 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:15:22,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956002781] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:15:22,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:15:22,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 25 [2025-01-10 01:15:22,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132718002] [2025-01-10 01:15:22,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:15:22,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-10 01:15:22,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:22,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-10 01:15:22,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2025-01-10 01:15:22,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-01-10 01:15:22,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 210 transitions, 2901 flow. Second operand has 25 states, 25 states have (on average 23.76) internal successors, (594), 25 states have internal predecessors, (594), 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:15:22,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:22,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-01-10 01:15:22,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:24,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-10 01:15:52,132 WARN L286 SmtUtils]: Spent 17.89s on a formula simplification. DAG size of input: 55 DAG size of output: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-10 01:15:56,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-10 01:16:02,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-10 01:16:08,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 01:16:10,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-10 01:16:11,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 01:16:12,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []