./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/unroll-cond-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/unroll-cond-3.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9fb4c28a8a216c266c6ae14d377c8e26c68bb16bf7c2fe2809f039d12d6c4b55 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:14:27,747 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:14:27,804 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:27,808 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:14:27,808 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:14:27,829 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:14:27,829 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:14:27,830 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:14:27,830 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:14:27,830 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:14:27,830 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:14:27,831 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:14:27,832 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:14:27,832 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:14:27,832 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:14:27,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:14:27,832 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:14:27,832 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:14:27,832 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:14:27,832 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:14:27,832 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:14:27,832 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:14:27,832 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:14:27,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:14:27,832 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:14:27,832 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:14:27,832 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:14:27,832 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:14:27,833 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:14:27,833 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:14:27,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:14:27,833 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:14:27,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:14:27,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:14:27,833 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:14:27,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:14:27,833 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:14:27,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:14:27,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:14:27,833 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:14:27,833 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:14:27,833 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:14:27,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:14:27,833 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:14:27,833 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:14:27,833 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:14:27,834 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:14:27,834 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 -> 9fb4c28a8a216c266c6ae14d377c8e26c68bb16bf7c2fe2809f039d12d6c4b55 [2025-01-10 01:14:28,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:14:28,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:14:28,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:14:28,115 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:14:28,115 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:14:28,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-cond-3.wvr.c [2025-01-10 01:14:29,271 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f889ca92c/1fb2ea8b484c4f2c9e3e0993ab706531/FLAGf9c144265 [2025-01-10 01:14:29,477 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:14:29,477 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-3.wvr.c [2025-01-10 01:14:29,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f889ca92c/1fb2ea8b484c4f2c9e3e0993ab706531/FLAGf9c144265 [2025-01-10 01:14:29,811 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f889ca92c/1fb2ea8b484c4f2c9e3e0993ab706531 [2025-01-10 01:14:29,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:14:29,814 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:14:29,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:14:29,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:14:29,818 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:14:29,818 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:14:29" (1/1) ... [2025-01-10 01:14:29,819 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@184b5e86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:29, skipping insertion in model container [2025-01-10 01:14:29,821 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:14:29" (1/1) ... [2025-01-10 01:14:29,836 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:14:29,955 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:29,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:14:29,964 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:14:29,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:14:29,994 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:14:29,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:29 WrapperNode [2025-01-10 01:14:29,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:14:29,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:14:29,997 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:14:29,998 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:14:30,002 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:29" (1/1) ... [2025-01-10 01:14:30,012 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:29" (1/1) ... [2025-01-10 01:14:30,027 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 148 [2025-01-10 01:14:30,027 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:14:30,028 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:14:30,028 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:14:30,028 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:14:30,033 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:29" (1/1) ... [2025-01-10 01:14:30,034 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:29" (1/1) ... [2025-01-10 01:14:30,036 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:29" (1/1) ... [2025-01-10 01:14:30,050 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-10 01:14:30,050 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:29" (1/1) ... [2025-01-10 01:14:30,050 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:29" (1/1) ... [2025-01-10 01:14:30,054 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:29" (1/1) ... [2025-01-10 01:14:30,055 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:29" (1/1) ... [2025-01-10 01:14:30,057 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:29" (1/1) ... [2025-01-10 01:14:30,058 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:29" (1/1) ... [2025-01-10 01:14:30,058 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:29" (1/1) ... [2025-01-10 01:14:30,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:14:30,060 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:14:30,060 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:14:30,060 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:14:30,061 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:29" (1/1) ... [2025-01-10 01:14:30,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:14:30,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:30,086 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:30,088 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:30,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:14:30,104 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:14:30,104 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:14:30,104 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:14:30,104 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:14:30,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:14:30,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:14:30,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:14:30,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:14:30,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:14:30,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:14:30,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:14:30,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:14:30,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:14:30,105 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:30,164 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:14:30,166 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:14:30,409 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:14:30,410 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:14:30,561 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:14:30,561 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:14:30,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:14:30 BoogieIcfgContainer [2025-01-10 01:14:30,561 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:14:30,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:14:30,563 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:14:30,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:14:30,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:14:29" (1/3) ... [2025-01-10 01:14:30,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c8ec150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:14:30, skipping insertion in model container [2025-01-10 01:14:30,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:29" (2/3) ... [2025-01-10 01:14:30,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c8ec150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:14:30, skipping insertion in model container [2025-01-10 01:14:30,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:14:30" (3/3) ... [2025-01-10 01:14:30,569 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-cond-3.wvr.c [2025-01-10 01:14:30,580 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:14:30,581 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-cond-3.wvr.c that has 3 procedures, 44 locations, 1 initial locations, 3 loop locations, and 16 error locations. [2025-01-10 01:14:30,581 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:14:30,652 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 01:14:30,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 48 transitions, 110 flow [2025-01-10 01:14:30,706 INFO L124 PetriNetUnfolderBase]: 5/46 cut-off events. [2025-01-10 01:14:30,708 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:14:30,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 46 events. 5/46 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 100 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-01-10 01:14:30,711 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 48 transitions, 110 flow [2025-01-10 01:14:30,713 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 45 transitions, 102 flow [2025-01-10 01:14:30,717 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:14:30,729 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;@3d5dc208, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:14:30,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-01-10 01:14:30,732 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:14:30,732 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:14:30,733 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:14:30,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:30,733 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:14:30,734 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:14:30,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:30,738 INFO L85 PathProgramCache]: Analyzing trace with hash 525135, now seen corresponding path program 1 times [2025-01-10 01:14:30,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:30,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66567990] [2025-01-10 01:14:30,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:30,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:30,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:14:30,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:14:30,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:30,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:30,909 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:30,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:30,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66567990] [2025-01-10 01:14:30,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66567990] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:30,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:30,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:14:30,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331789596] [2025-01-10 01:14:30,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:30,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:14:30,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:30,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:14:30,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:14:30,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2025-01-10 01:14:30,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:30,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:30,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2025-01-10 01:14:30,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:31,070 INFO L124 PetriNetUnfolderBase]: 147/326 cut-off events. [2025-01-10 01:14:31,070 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-01-10 01:14:31,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 326 events. 147/326 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1607 event pairs, 94 based on Foata normal form. 1/257 useless extension candidates. Maximal degree in co-relation 508. Up to 235 conditions per place. [2025-01-10 01:14:31,074 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 23 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2025-01-10 01:14:31,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 42 transitions, 146 flow [2025-01-10 01:14:31,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:14:31,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:14:31,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-01-10 01:14:31,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-01-10 01:14:31,086 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 102 flow. Second operand 3 states and 87 transitions. [2025-01-10 01:14:31,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 42 transitions, 146 flow [2025-01-10 01:14:31,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 138 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:14:31,095 INFO L231 Difference]: Finished difference. Result has 42 places, 42 transitions, 92 flow [2025-01-10 01:14:31,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=42, PETRI_TRANSITIONS=42} [2025-01-10 01:14:31,100 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -5 predicate places. [2025-01-10 01:14:31,100 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 42 transitions, 92 flow [2025-01-10 01:14:31,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:31,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:31,101 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:14:31,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:14:31,101 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:14:31,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:31,101 INFO L85 PathProgramCache]: Analyzing trace with hash 525136, now seen corresponding path program 1 times [2025-01-10 01:14:31,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:31,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819462378] [2025-01-10 01:14:31,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:31,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:31,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:14:31,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:14:31,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:31,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:31,357 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:31,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:31,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819462378] [2025-01-10 01:14:31,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819462378] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:31,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:31,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:14:31,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045126234] [2025-01-10 01:14:31,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:31,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:14:31,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:31,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:14:31,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:14:31,388 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2025-01-10 01:14:31,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 42 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 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:31,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:31,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2025-01-10 01:14:31,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:31,494 INFO L124 PetriNetUnfolderBase]: 147/328 cut-off events. [2025-01-10 01:14:31,494 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-10 01:14:31,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 578 conditions, 328 events. 147/328 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1601 event pairs, 94 based on Foata normal form. 1/259 useless extension candidates. Maximal degree in co-relation 559. Up to 239 conditions per place. [2025-01-10 01:14:31,497 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 26 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2025-01-10 01:14:31,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 44 transitions, 152 flow [2025-01-10 01:14:31,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:14:31,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:14:31,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-01-10 01:14:31,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-01-10 01:14:31,498 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 92 flow. Second operand 3 states and 90 transitions. [2025-01-10 01:14:31,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 44 transitions, 152 flow [2025-01-10 01:14:31,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:14:31,500 INFO L231 Difference]: Finished difference. Result has 43 places, 43 transitions, 102 flow [2025-01-10 01:14:31,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=43} [2025-01-10 01:14:31,501 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2025-01-10 01:14:31,501 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 43 transitions, 102 flow [2025-01-10 01:14:31,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 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:31,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:31,501 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:14:31,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:14:31,501 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:14:31,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:31,502 INFO L85 PathProgramCache]: Analyzing trace with hash 504671502, now seen corresponding path program 1 times [2025-01-10 01:14:31,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:31,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860408918] [2025-01-10 01:14:31,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:31,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:31,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:14:31,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:14:31,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:31,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:31,740 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:31,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:31,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860408918] [2025-01-10 01:14:31,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860408918] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:31,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664095094] [2025-01-10 01:14:31,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:31,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:31,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:31,743 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:31,745 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:31,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:14:31,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:14:31,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:31,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:31,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:14:31,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:31,838 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:31,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:14:31,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:32,060 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:32,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664095094] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:32,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:32,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:14:32,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862103472] [2025-01-10 01:14:32,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:32,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:14:32,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:32,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:14:32,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:14:32,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2025-01-10 01:14:32,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 102 flow. Second operand has 11 states, 11 states have (on average 21.363636363636363) internal successors, (235), 11 states have internal predecessors, (235), 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:32,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:32,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2025-01-10 01:14:32,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:32,401 INFO L124 PetriNetUnfolderBase]: 147/327 cut-off events. [2025-01-10 01:14:32,401 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-10 01:14:32,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 327 events. 147/327 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1599 event pairs, 94 based on Foata normal form. 0/258 useless extension candidates. Maximal degree in co-relation 567. Up to 235 conditions per place. [2025-01-10 01:14:32,403 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 22 selfloop transitions, 5 changer transitions 0/43 dead transitions. [2025-01-10 01:14:32,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 154 flow [2025-01-10 01:14:32,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:32,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2025-01-10 01:14:32,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-01-10 01:14:32,405 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 102 flow. Second operand 5 states and 128 transitions. [2025-01-10 01:14:32,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 154 flow [2025-01-10 01:14:32,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 152 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:14:32,406 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 114 flow [2025-01-10 01:14:32,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2025-01-10 01:14:32,407 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2025-01-10 01:14:32,407 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 114 flow [2025-01-10 01:14:32,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 21.363636363636363) internal successors, (235), 11 states have internal predecessors, (235), 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:32,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:32,408 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:32,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 01:14:32,612 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:32,613 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:14:32,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:32,613 INFO L85 PathProgramCache]: Analyzing trace with hash -2008249981, now seen corresponding path program 1 times [2025-01-10 01:14:32,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:32,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25985904] [2025-01-10 01:14:32,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:32,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:32,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:14:32,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:14:32,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:32,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:32,667 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:32,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:32,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25985904] [2025-01-10 01:14:32,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25985904] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:32,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:32,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:14:32,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729468377] [2025-01-10 01:14:32,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:32,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:14:32,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:32,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:14:32,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:14:32,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-01-10 01:14:32,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:32,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:32,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-01-10 01:14:32,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:32,769 INFO L124 PetriNetUnfolderBase]: 147/292 cut-off events. [2025-01-10 01:14:32,769 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 01:14:32,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 553 conditions, 292 events. 147/292 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1201 event pairs, 94 based on Foata normal form. 0/258 useless extension candidates. Maximal degree in co-relation 524. Up to 234 conditions per place. [2025-01-10 01:14:32,772 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 25 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-01-10 01:14:32,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 37 transitions, 156 flow [2025-01-10 01:14:32,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:14:32,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:14:32,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-01-10 01:14:32,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.453125 [2025-01-10 01:14:32,775 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 114 flow. Second operand 4 states and 87 transitions. [2025-01-10 01:14:32,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 37 transitions, 156 flow [2025-01-10 01:14:32,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 146 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 01:14:32,776 INFO L231 Difference]: Finished difference. Result has 40 places, 37 transitions, 96 flow [2025-01-10 01:14:32,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=40, PETRI_TRANSITIONS=37} [2025-01-10 01:14:32,777 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -7 predicate places. [2025-01-10 01:14:32,777 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 37 transitions, 96 flow [2025-01-10 01:14:32,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:32,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:32,777 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:32,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:14:32,777 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:14:32,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:32,777 INFO L85 PathProgramCache]: Analyzing trace with hash -2008249980, now seen corresponding path program 1 times [2025-01-10 01:14:32,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:32,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430779502] [2025-01-10 01:14:32,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:32,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:32,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:14:32,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:14:32,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:32,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:32,923 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:32,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:32,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430779502] [2025-01-10 01:14:32,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430779502] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:32,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160569201] [2025-01-10 01:14:32,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:32,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:32,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:32,927 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:32,931 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:32,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:14:32,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:14:32,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:32,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:32,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:14:32,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:33,033 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:33,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:33,081 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:33,102 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:33,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160569201] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:33,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:33,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-01-10 01:14:33,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7704066] [2025-01-10 01:14:33,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:33,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:14:33,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:33,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:14:33,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:14:33,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2025-01-10 01:14:33,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 96 flow. Second operand has 9 states, 9 states have (on average 22.11111111111111) internal successors, (199), 9 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:33,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:33,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2025-01-10 01:14:33,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:33,403 INFO L124 PetriNetUnfolderBase]: 307/551 cut-off events. [2025-01-10 01:14:33,403 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-10 01:14:33,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 551 events. 307/551 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2624 event pairs, 100 based on Foata normal form. 0/464 useless extension candidates. Maximal degree in co-relation 1043. Up to 277 conditions per place. [2025-01-10 01:14:33,405 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 43 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2025-01-10 01:14:33,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 56 transitions, 231 flow [2025-01-10 01:14:33,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:33,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:33,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2025-01-10 01:14:33,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2025-01-10 01:14:33,408 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 96 flow. Second operand 5 states and 148 transitions. [2025-01-10 01:14:33,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 56 transitions, 231 flow [2025-01-10 01:14:33,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 56 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:14:33,410 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 109 flow [2025-01-10 01:14:33,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2025-01-10 01:14:33,411 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2025-01-10 01:14:33,412 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 109 flow [2025-01-10 01:14:33,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.11111111111111) internal successors, (199), 9 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:33,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:33,413 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:33,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:14:33,613 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:33,614 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:14:33,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:33,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1487897785, now seen corresponding path program 1 times [2025-01-10 01:14:33,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:33,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026141688] [2025-01-10 01:14:33,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:33,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:33,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:14:33,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:14:33,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:33,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:33,752 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:33,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:33,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026141688] [2025-01-10 01:14:33,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026141688] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:33,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363611546] [2025-01-10 01:14:33,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:33,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:33,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:33,755 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:33,757 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:33,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:14:33,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:14:33,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:33,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:33,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:14:33,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:33,904 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:33,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:33,959 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:34,110 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:34,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363611546] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:34,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:34,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-01-10 01:14:34,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296134090] [2025-01-10 01:14:34,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:34,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:14:34,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:34,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:14:34,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:14:34,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2025-01-10 01:14:34,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 109 flow. Second operand has 16 states, 16 states have (on average 21.8125) internal successors, (349), 16 states have internal predecessors, (349), 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:34,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:34,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2025-01-10 01:14:34,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:34,839 INFO L124 PetriNetUnfolderBase]: 563/1059 cut-off events. [2025-01-10 01:14:34,840 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2025-01-10 01:14:34,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2149 conditions, 1059 events. 563/1059 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5776 event pairs, 305 based on Foata normal form. 0/918 useless extension candidates. Maximal degree in co-relation 1123. Up to 473 conditions per place. [2025-01-10 01:14:34,846 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 76 selfloop transitions, 9 changer transitions 0/94 dead transitions. [2025-01-10 01:14:34,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 94 transitions, 416 flow [2025-01-10 01:14:34,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:14:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:14:34,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 245 transitions. [2025-01-10 01:14:34,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6380208333333334 [2025-01-10 01:14:34,848 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 109 flow. Second operand 8 states and 245 transitions. [2025-01-10 01:14:34,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 94 transitions, 416 flow [2025-01-10 01:14:34,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 94 transitions, 408 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:14:34,850 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 174 flow [2025-01-10 01:14:34,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=174, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2025-01-10 01:14:34,852 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 5 predicate places. [2025-01-10 01:14:34,853 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 174 flow [2025-01-10 01:14:34,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 21.8125) internal successors, (349), 16 states have internal predecessors, (349), 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:34,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:34,853 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:34,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:14:35,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:35,054 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:14:35,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:35,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1510090925, now seen corresponding path program 1 times [2025-01-10 01:14:35,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:35,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836786041] [2025-01-10 01:14:35,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:35,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:35,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:14:35,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:14:35,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:35,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:35,185 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:35,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:35,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836786041] [2025-01-10 01:14:35,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836786041] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:35,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585122067] [2025-01-10 01:14:35,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:35,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:35,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:35,189 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:35,191 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:35,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:14:35,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:14:35,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:35,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:35,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:14:35,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:35,299 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:35,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:35,346 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:35,362 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:35,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585122067] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:35,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:35,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-01-10 01:14:35,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344274433] [2025-01-10 01:14:35,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:35,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:14:35,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:35,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:14:35,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:14:35,439 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-01-10 01:14:35,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 174 flow. Second operand has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 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:35,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:35,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-01-10 01:14:35,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:35,668 INFO L124 PetriNetUnfolderBase]: 1079/1855 cut-off events. [2025-01-10 01:14:35,668 INFO L125 PetriNetUnfolderBase]: For 946/990 co-relation queries the response was YES. [2025-01-10 01:14:35,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4272 conditions, 1855 events. 1079/1855 cut-off events. For 946/990 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9886 event pairs, 246 based on Foata normal form. 0/1644 useless extension candidates. Maximal degree in co-relation 3536. Up to 1197 conditions per place. [2025-01-10 01:14:35,679 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 51 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2025-01-10 01:14:35,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 63 transitions, 356 flow [2025-01-10 01:14:35,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:35,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:35,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-01-10 01:14:35,681 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-01-10 01:14:35,681 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 174 flow. Second operand 5 states and 130 transitions. [2025-01-10 01:14:35,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 63 transitions, 356 flow [2025-01-10 01:14:35,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 63 transitions, 350 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-10 01:14:35,687 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 207 flow [2025-01-10 01:14:35,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=207, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2025-01-10 01:14:35,688 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 9 predicate places. [2025-01-10 01:14:35,688 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 207 flow [2025-01-10 01:14:35,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 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:35,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:35,688 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:35,695 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:35,889 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,SelfDestructingSolverStorable6 [2025-01-10 01:14:35,889 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:14:35,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:35,890 INFO L85 PathProgramCache]: Analyzing trace with hash 431822134, now seen corresponding path program 1 times [2025-01-10 01:14:35,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:35,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550715110] [2025-01-10 01:14:35,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:35,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:35,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:14:35,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:14:35,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:35,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:36,018 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:36,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:36,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550715110] [2025-01-10 01:14:36,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550715110] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:36,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45617532] [2025-01-10 01:14:36,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:36,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:36,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:36,021 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:36,023 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:36,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:14:36,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:14:36,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:36,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:36,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:14:36,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:36,152 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:36,152 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:36,167 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:36,282 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:36,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45617532] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:36,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:36,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-01-10 01:14:36,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204540655] [2025-01-10 01:14:36,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:36,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:14:36,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:36,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:14:36,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:14:36,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-01-10 01:14:36,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 207 flow. Second operand has 13 states, 13 states have (on average 18.46153846153846) internal successors, (240), 13 states have internal predecessors, (240), 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:36,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:36,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-01-10 01:14:36,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:36,674 INFO L124 PetriNetUnfolderBase]: 1125/1931 cut-off events. [2025-01-10 01:14:36,674 INFO L125 PetriNetUnfolderBase]: For 982/1056 co-relation queries the response was YES. [2025-01-10 01:14:36,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4783 conditions, 1931 events. 1125/1931 cut-off events. For 982/1056 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10219 event pairs, 540 based on Foata normal form. 0/1728 useless extension candidates. Maximal degree in co-relation 4052. Up to 1451 conditions per place. [2025-01-10 01:14:36,684 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 63 selfloop transitions, 10 changer transitions 0/78 dead transitions. [2025-01-10 01:14:36,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 78 transitions, 461 flow [2025-01-10 01:14:36,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:14:36,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:14:36,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2025-01-10 01:14:36,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-01-10 01:14:36,685 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 207 flow. Second operand 7 states and 176 transitions. [2025-01-10 01:14:36,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 78 transitions, 461 flow [2025-01-10 01:14:36,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 78 transitions, 449 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:14:36,688 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 250 flow [2025-01-10 01:14:36,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=250, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2025-01-10 01:14:36,688 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 14 predicate places. [2025-01-10 01:14:36,688 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 250 flow [2025-01-10 01:14:36,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.46153846153846) internal successors, (240), 13 states have internal predecessors, (240), 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:36,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:36,689 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:36,695 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:36,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:36,889 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:14:36,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:36,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1551695927, now seen corresponding path program 2 times [2025-01-10 01:14:36,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:36,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994287499] [2025-01-10 01:14:36,890 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:36,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:36,895 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-01-10 01:14:36,899 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:36,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:36,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:36,981 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:36,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:36,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994287499] [2025-01-10 01:14:36,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994287499] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:36,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730319272] [2025-01-10 01:14:36,981 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:36,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:36,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:36,984 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:36,985 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:37,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-01-10 01:14:37,026 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:37,027 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:37,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:37,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 01:14:37,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:37,040 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:37,148 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:37,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:37,239 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:37,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730319272] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:37,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:37,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2025-01-10 01:14:37,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225656627] [2025-01-10 01:14:37,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:37,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:14:37,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:37,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:14:37,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:14:37,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2025-01-10 01:14:37,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 250 flow. Second operand has 10 states, 10 states have (on average 22.9) internal successors, (229), 10 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:37,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:37,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2025-01-10 01:14:37,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:37,638 INFO L124 PetriNetUnfolderBase]: 879/1625 cut-off events. [2025-01-10 01:14:37,638 INFO L125 PetriNetUnfolderBase]: For 635/635 co-relation queries the response was YES. [2025-01-10 01:14:37,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4083 conditions, 1625 events. 879/1625 cut-off events. For 635/635 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 9472 event pairs, 474 based on Foata normal form. 0/1579 useless extension candidates. Maximal degree in co-relation 3509. Up to 1036 conditions per place. [2025-01-10 01:14:37,645 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 52 selfloop transitions, 9 changer transitions 0/70 dead transitions. [2025-01-10 01:14:37,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 70 transitions, 446 flow [2025-01-10 01:14:37,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:37,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2025-01-10 01:14:37,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5791666666666667 [2025-01-10 01:14:37,646 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 250 flow. Second operand 5 states and 139 transitions. [2025-01-10 01:14:37,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 70 transitions, 446 flow [2025-01-10 01:14:37,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 70 transitions, 429 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:14:37,648 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 248 flow [2025-01-10 01:14:37,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=248, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2025-01-10 01:14:37,649 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 13 predicate places. [2025-01-10 01:14:37,649 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 248 flow [2025-01-10 01:14:37,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.9) internal successors, (229), 10 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:37,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:37,649 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:37,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 01:14:37,854 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,SelfDestructingSolverStorable8 [2025-01-10 01:14:37,854 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:14:37,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:37,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1631755201, now seen corresponding path program 1 times [2025-01-10 01:14:37,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:37,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133833141] [2025-01-10 01:14:37,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:37,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:37,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:14:37,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:14:37,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:37,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:37,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:14:37,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:37,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133833141] [2025-01-10 01:14:37,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133833141] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:37,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685284781] [2025-01-10 01:14:37,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:37,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:37,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:37,968 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:37,969 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:38,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:14:38,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:14:38,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:38,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:38,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:14:38,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:38,111 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:38,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:38,138 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:38,263 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:38,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685284781] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:38,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:38,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-01-10 01:14:38,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907963800] [2025-01-10 01:14:38,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:38,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:14:38,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:38,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:14:38,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:14:38,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-01-10 01:14:38,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 248 flow. Second operand has 16 states, 16 states have (on average 18.1875) internal successors, (291), 16 states have internal predecessors, (291), 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:38,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:38,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-01-10 01:14:38,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:38,890 INFO L124 PetriNetUnfolderBase]: 1010/1733 cut-off events. [2025-01-10 01:14:38,890 INFO L125 PetriNetUnfolderBase]: For 1794/1794 co-relation queries the response was YES. [2025-01-10 01:14:38,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4668 conditions, 1733 events. 1010/1733 cut-off events. For 1794/1794 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8917 event pairs, 540 based on Foata normal form. 16/1642 useless extension candidates. Maximal degree in co-relation 3940. Up to 853 conditions per place. [2025-01-10 01:14:38,898 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 72 selfloop transitions, 16 changer transitions 0/92 dead transitions. [2025-01-10 01:14:38,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 92 transitions, 575 flow [2025-01-10 01:14:38,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:14:38,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:14:38,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2025-01-10 01:14:38,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.546875 [2025-01-10 01:14:38,900 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 248 flow. Second operand 8 states and 210 transitions. [2025-01-10 01:14:38,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 92 transitions, 575 flow [2025-01-10 01:14:38,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 92 transitions, 539 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:14:38,905 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 319 flow [2025-01-10 01:14:38,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=319, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2025-01-10 01:14:38,905 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 18 predicate places. [2025-01-10 01:14:38,905 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 319 flow [2025-01-10 01:14:38,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 18.1875) internal successors, (291), 16 states have internal predecessors, (291), 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:38,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:38,906 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:38,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 01:14:39,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:39,106 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:14:39,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:39,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1545920268, now seen corresponding path program 2 times [2025-01-10 01:14:39,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:39,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610287386] [2025-01-10 01:14:39,107 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:39,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:39,110 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-01-10 01:14:39,125 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:39,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:39,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:39,269 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:39,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:39,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610287386] [2025-01-10 01:14:39,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610287386] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:39,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:39,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:14:39,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106831774] [2025-01-10 01:14:39,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:39,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:14:39,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:39,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:14:39,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:14:39,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-01-10 01:14:39,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 319 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:39,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:39,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-01-10 01:14:39,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:39,515 INFO L124 PetriNetUnfolderBase]: 916/1596 cut-off events. [2025-01-10 01:14:39,515 INFO L125 PetriNetUnfolderBase]: For 1545/1545 co-relation queries the response was YES. [2025-01-10 01:14:39,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4528 conditions, 1596 events. 916/1596 cut-off events. For 1545/1545 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8360 event pairs, 561 based on Foata normal form. 16/1529 useless extension candidates. Maximal degree in co-relation 3914. Up to 1209 conditions per place. [2025-01-10 01:14:39,522 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 51 selfloop transitions, 9 changer transitions 0/64 dead transitions. [2025-01-10 01:14:39,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 64 transitions, 472 flow [2025-01-10 01:14:39,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:39,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:39,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2025-01-10 01:14:39,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2025-01-10 01:14:39,524 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 319 flow. Second operand 5 states and 116 transitions. [2025-01-10 01:14:39,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 64 transitions, 472 flow [2025-01-10 01:14:39,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 64 transitions, 455 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-01-10 01:14:39,528 INFO L231 Difference]: Finished difference. Result has 62 places, 54 transitions, 308 flow [2025-01-10 01:14:39,529 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=308, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2025-01-10 01:14:39,529 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 15 predicate places. [2025-01-10 01:14:39,529 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 308 flow [2025-01-10 01:14:39,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:39,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:39,529 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:39,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:14:39,530 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:14:39,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:39,530 INFO L85 PathProgramCache]: Analyzing trace with hash 428308605, now seen corresponding path program 2 times [2025-01-10 01:14:39,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:39,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417425005] [2025-01-10 01:14:39,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:39,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:39,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-10 01:14:39,549 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:39,549 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:39,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:39,703 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:39,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:39,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417425005] [2025-01-10 01:14:39,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417425005] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:39,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:39,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:14:39,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065855473] [2025-01-10 01:14:39,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:39,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:14:39,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:39,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:14:39,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:14:39,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-01-10 01:14:39,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 308 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 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:39,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:39,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-01-10 01:14:39,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:39,978 INFO L124 PetriNetUnfolderBase]: 849/1483 cut-off events. [2025-01-10 01:14:39,978 INFO L125 PetriNetUnfolderBase]: For 1524/1524 co-relation queries the response was YES. [2025-01-10 01:14:39,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4259 conditions, 1483 events. 849/1483 cut-off events. For 1524/1524 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7733 event pairs, 246 based on Foata normal form. 16/1448 useless extension candidates. Maximal degree in co-relation 3661. Up to 504 conditions per place. [2025-01-10 01:14:39,986 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 51 selfloop transitions, 22 changer transitions 0/77 dead transitions. [2025-01-10 01:14:39,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 77 transitions, 545 flow [2025-01-10 01:14:39,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:14:39,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:14:39,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-01-10 01:14:39,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5034722222222222 [2025-01-10 01:14:39,987 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 308 flow. Second operand 6 states and 145 transitions. [2025-01-10 01:14:39,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 77 transitions, 545 flow [2025-01-10 01:14:39,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 77 transitions, 527 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:14:39,994 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 351 flow [2025-01-10 01:14:39,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=351, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2025-01-10 01:14:39,995 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 14 predicate places. [2025-01-10 01:14:39,995 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 351 flow [2025-01-10 01:14:39,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 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:39,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:39,996 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:39,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:14:39,996 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:14:39,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:39,996 INFO L85 PathProgramCache]: Analyzing trace with hash 275495579, now seen corresponding path program 1 times [2025-01-10 01:14:39,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:39,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932266172] [2025-01-10 01:14:39,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:39,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:40,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:14:40,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:14:40,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:40,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:40,027 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:40,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:40,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932266172] [2025-01-10 01:14:40,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932266172] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:40,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:40,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:14:40,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470728349] [2025-01-10 01:14:40,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:40,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:14:40,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:40,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:14:40,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:14:40,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2025-01-10 01:14:40,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 351 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,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:40,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2025-01-10 01:14:40,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:40,175 INFO L124 PetriNetUnfolderBase]: 848/1471 cut-off events. [2025-01-10 01:14:40,175 INFO L125 PetriNetUnfolderBase]: For 2354/2354 co-relation queries the response was YES. [2025-01-10 01:14:40,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4630 conditions, 1471 events. 848/1471 cut-off events. For 2354/2354 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7602 event pairs, 218 based on Foata normal form. 2/1430 useless extension candidates. Maximal degree in co-relation 4007. Up to 1085 conditions per place. [2025-01-10 01:14:40,185 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 61 selfloop transitions, 9 changer transitions 1/75 dead transitions. [2025-01-10 01:14:40,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 75 transitions, 610 flow [2025-01-10 01:14:40,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:14:40,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:14:40,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2025-01-10 01:14:40,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7361111111111112 [2025-01-10 01:14:40,187 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 351 flow. Second operand 3 states and 106 transitions. [2025-01-10 01:14:40,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 75 transitions, 610 flow [2025-01-10 01:14:40,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 75 transitions, 580 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-01-10 01:14:40,194 INFO L231 Difference]: Finished difference. Result has 61 places, 62 transitions, 446 flow [2025-01-10 01:14:40,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=446, PETRI_PLACES=61, PETRI_TRANSITIONS=62} [2025-01-10 01:14:40,195 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 14 predicate places. [2025-01-10 01:14:40,195 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 62 transitions, 446 flow [2025-01-10 01:14:40,195 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:40,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:40,195 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:40,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:14:40,195 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:14:40,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:40,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1245033364, now seen corresponding path program 1 times [2025-01-10 01:14:40,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:40,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257642694] [2025-01-10 01:14:40,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:40,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:40,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:14:40,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:14:40,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:40,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:40,288 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:40,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:40,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257642694] [2025-01-10 01:14:40,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257642694] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:40,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:40,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:14:40,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123450777] [2025-01-10 01:14:40,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:40,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:14:40,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:40,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:14:40,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:14:40,299 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2025-01-10 01:14:40,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 62 transitions, 446 flow. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:40,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2025-01-10 01:14:40,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:40,485 INFO L124 PetriNetUnfolderBase]: 954/1626 cut-off events. [2025-01-10 01:14:40,485 INFO L125 PetriNetUnfolderBase]: For 2637/2637 co-relation queries the response was YES. [2025-01-10 01:14:40,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5274 conditions, 1626 events. 954/1626 cut-off events. For 2637/2637 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8817 event pairs, 334 based on Foata normal form. 6/1624 useless extension candidates. Maximal degree in co-relation 4588. Up to 858 conditions per place. [2025-01-10 01:14:40,497 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 120 selfloop transitions, 9 changer transitions 0/132 dead transitions. [2025-01-10 01:14:40,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 132 transitions, 1193 flow [2025-01-10 01:14:40,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:40,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:40,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2025-01-10 01:14:40,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2025-01-10 01:14:40,498 INFO L175 Difference]: Start difference. First operand has 61 places, 62 transitions, 446 flow. Second operand 5 states and 165 transitions. [2025-01-10 01:14:40,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 132 transitions, 1193 flow [2025-01-10 01:14:40,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 132 transitions, 1170 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:14:40,509 INFO L231 Difference]: Finished difference. Result has 67 places, 66 transitions, 504 flow [2025-01-10 01:14:40,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=504, PETRI_PLACES=67, PETRI_TRANSITIONS=66} [2025-01-10 01:14:40,510 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 20 predicate places. [2025-01-10 01:14:40,510 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 504 flow [2025-01-10 01:14:40,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:40,511 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:40,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:14:40,511 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:14:40,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:40,511 INFO L85 PathProgramCache]: Analyzing trace with hash -264379514, now seen corresponding path program 2 times [2025-01-10 01:14:40,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:40,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584343576] [2025-01-10 01:14:40,512 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:40,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:40,516 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-10 01:14:40,523 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 20 statements. [2025-01-10 01:14:40,523 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:40,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:40,637 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:40,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:40,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584343576] [2025-01-10 01:14:40,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584343576] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:40,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:40,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:14:40,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678135302] [2025-01-10 01:14:40,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:40,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:14:40,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:40,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:14:40,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:14:40,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-01-10 01:14:40,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 504 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:40,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-01-10 01:14:40,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:40,871 INFO L124 PetriNetUnfolderBase]: 1127/1887 cut-off events. [2025-01-10 01:14:40,872 INFO L125 PetriNetUnfolderBase]: For 3660/3660 co-relation queries the response was YES. [2025-01-10 01:14:40,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6788 conditions, 1887 events. 1127/1887 cut-off events. For 3660/3660 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9234 event pairs, 454 based on Foata normal form. 64/1951 useless extension candidates. Maximal degree in co-relation 6007. Up to 1082 conditions per place. [2025-01-10 01:14:40,879 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 98 selfloop transitions, 21 changer transitions 0/120 dead transitions. [2025-01-10 01:14:40,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 120 transitions, 1069 flow [2025-01-10 01:14:40,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:14:40,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:14:40,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 199 transitions. [2025-01-10 01:14:40,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5922619047619048 [2025-01-10 01:14:40,882 INFO L175 Difference]: Start difference. First operand has 67 places, 66 transitions, 504 flow. Second operand 7 states and 199 transitions. [2025-01-10 01:14:40,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 120 transitions, 1069 flow [2025-01-10 01:14:40,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 120 transitions, 1019 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-01-10 01:14:40,891 INFO L231 Difference]: Finished difference. Result has 76 places, 70 transitions, 611 flow [2025-01-10 01:14:40,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=611, PETRI_PLACES=76, PETRI_TRANSITIONS=70} [2025-01-10 01:14:40,891 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 29 predicate places. [2025-01-10 01:14:40,891 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 70 transitions, 611 flow [2025-01-10 01:14:40,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:40,892 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:40,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:14:40,892 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:14:40,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:40,892 INFO L85 PathProgramCache]: Analyzing trace with hash -141080502, now seen corresponding path program 3 times [2025-01-10 01:14:40,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:40,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594310315] [2025-01-10 01:14:40,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:14:40,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:40,897 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-01-10 01:14:40,902 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 20 statements. [2025-01-10 01:14:40,902 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:14:40,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:40,958 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:40,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:40,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594310315] [2025-01-10 01:14:40,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594310315] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:40,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:40,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:14:40,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770450633] [2025-01-10 01:14:40,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:40,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:14:40,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:40,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:14:40,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:14:40,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-01-10 01:14:40,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 70 transitions, 611 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:40,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-01-10 01:14:40,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:41,170 INFO L124 PetriNetUnfolderBase]: 1215/2031 cut-off events. [2025-01-10 01:14:41,171 INFO L125 PetriNetUnfolderBase]: For 6154/6154 co-relation queries the response was YES. [2025-01-10 01:14:41,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8130 conditions, 2031 events. 1215/2031 cut-off events. For 6154/6154 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 10440 event pairs, 444 based on Foata normal form. 6/2037 useless extension candidates. Maximal degree in co-relation 7328. Up to 1026 conditions per place. [2025-01-10 01:14:41,182 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 98 selfloop transitions, 26 changer transitions 0/125 dead transitions. [2025-01-10 01:14:41,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 125 transitions, 1294 flow [2025-01-10 01:14:41,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:41,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:41,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2025-01-10 01:14:41,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6541666666666667 [2025-01-10 01:14:41,184 INFO L175 Difference]: Start difference. First operand has 76 places, 70 transitions, 611 flow. Second operand 5 states and 157 transitions. [2025-01-10 01:14:41,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 125 transitions, 1294 flow [2025-01-10 01:14:41,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 125 transitions, 1245 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-01-10 01:14:41,200 INFO L231 Difference]: Finished difference. Result has 81 places, 82 transitions, 848 flow [2025-01-10 01:14:41,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=848, PETRI_PLACES=81, PETRI_TRANSITIONS=82} [2025-01-10 01:14:41,200 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 34 predicate places. [2025-01-10 01:14:41,201 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 82 transitions, 848 flow [2025-01-10 01:14:41,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:41,201 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:41,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:14:41,201 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:14:41,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:41,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1120680772, now seen corresponding path program 4 times [2025-01-10 01:14:41,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:41,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278377801] [2025-01-10 01:14:41,201 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:14:41,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:41,206 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-01-10 01:14:41,214 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:14:41,214 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:14:41,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:41,278 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:41,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:41,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278377801] [2025-01-10 01:14:41,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278377801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:41,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:41,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:14:41,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731229853] [2025-01-10 01:14:41,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:41,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:14:41,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:41,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:14:41,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:14:41,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-01-10 01:14:41,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 82 transitions, 848 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:41,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-01-10 01:14:41,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:41,501 INFO L124 PetriNetUnfolderBase]: 1209/2025 cut-off events. [2025-01-10 01:14:41,501 INFO L125 PetriNetUnfolderBase]: For 8204/8204 co-relation queries the response was YES. [2025-01-10 01:14:41,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8669 conditions, 2025 events. 1209/2025 cut-off events. For 8204/8204 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 10139 event pairs, 618 based on Foata normal form. 6/2031 useless extension candidates. Maximal degree in co-relation 7864. Up to 1550 conditions per place. [2025-01-10 01:14:41,511 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 71 selfloop transitions, 38 changer transitions 0/110 dead transitions. [2025-01-10 01:14:41,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 110 transitions, 1331 flow [2025-01-10 01:14:41,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:41,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:41,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2025-01-10 01:14:41,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-01-10 01:14:41,513 INFO L175 Difference]: Start difference. First operand has 81 places, 82 transitions, 848 flow. Second operand 5 states and 145 transitions. [2025-01-10 01:14:41,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 110 transitions, 1331 flow [2025-01-10 01:14:41,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 110 transitions, 1303 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-10 01:14:41,528 INFO L231 Difference]: Finished difference. Result has 87 places, 94 transitions, 1148 flow [2025-01-10 01:14:41,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1148, PETRI_PLACES=87, PETRI_TRANSITIONS=94} [2025-01-10 01:14:41,528 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 40 predicate places. [2025-01-10 01:14:41,528 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 94 transitions, 1148 flow [2025-01-10 01:14:41,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:41,529 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:41,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:14:41,529 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:14:41,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:41,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1536348088, now seen corresponding path program 5 times [2025-01-10 01:14:41,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:41,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199405151] [2025-01-10 01:14:41,529 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:14:41,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:41,533 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-10 01:14:41,539 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:14:41,539 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:14:41,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:41,625 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:41,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:41,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199405151] [2025-01-10 01:14:41,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199405151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:41,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:41,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:14:41,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658623991] [2025-01-10 01:14:41,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:41,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:14:41,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:41,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:14:41,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:14:41,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-01-10 01:14:41,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 94 transitions, 1148 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:41,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-01-10 01:14:41,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:41,871 INFO L124 PetriNetUnfolderBase]: 1241/2077 cut-off events. [2025-01-10 01:14:41,872 INFO L125 PetriNetUnfolderBase]: For 9785/9785 co-relation queries the response was YES. [2025-01-10 01:14:41,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9183 conditions, 2077 events. 1241/2077 cut-off events. For 9785/9785 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10727 event pairs, 430 based on Foata normal form. 24/2101 useless extension candidates. Maximal degree in co-relation 8363. Up to 1042 conditions per place. [2025-01-10 01:14:41,882 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 109 selfloop transitions, 31 changer transitions 0/141 dead transitions. [2025-01-10 01:14:41,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 141 transitions, 1687 flow [2025-01-10 01:14:41,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:14:41,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:14:41,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2025-01-10 01:14:41,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-01-10 01:14:41,883 INFO L175 Difference]: Start difference. First operand has 87 places, 94 transitions, 1148 flow. Second operand 6 states and 180 transitions. [2025-01-10 01:14:41,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 141 transitions, 1687 flow [2025-01-10 01:14:41,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 141 transitions, 1616 flow, removed 21 selfloop flow, removed 1 redundant places. [2025-01-10 01:14:41,904 INFO L231 Difference]: Finished difference. Result has 94 places, 97 transitions, 1187 flow [2025-01-10 01:14:41,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1187, PETRI_PLACES=94, PETRI_TRANSITIONS=97} [2025-01-10 01:14:41,904 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 47 predicate places. [2025-01-10 01:14:41,904 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 97 transitions, 1187 flow [2025-01-10 01:14:41,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:41,904 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:41,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 01:14:41,905 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:14:41,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:41,905 INFO L85 PathProgramCache]: Analyzing trace with hash -526308872, now seen corresponding path program 6 times [2025-01-10 01:14:41,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:41,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193142473] [2025-01-10 01:14:41,905 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:14:41,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:41,909 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-01-10 01:14:41,918 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 18 of 20 statements. [2025-01-10 01:14:41,918 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 01:14:41,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:41,994 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:41,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:41,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193142473] [2025-01-10 01:14:41,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193142473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:41,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:41,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:14:41,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842103826] [2025-01-10 01:14:41,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:41,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:14:41,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:41,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:14:41,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:14:42,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-01-10 01:14:42,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 97 transitions, 1187 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:42,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-01-10 01:14:42,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:42,209 INFO L124 PetriNetUnfolderBase]: 1193/1987 cut-off events. [2025-01-10 01:14:42,209 INFO L125 PetriNetUnfolderBase]: For 11306/11306 co-relation queries the response was YES. [2025-01-10 01:14:42,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9015 conditions, 1987 events. 1193/1987 cut-off events. For 11306/11306 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9770 event pairs, 578 based on Foata normal form. 24/2011 useless extension candidates. Maximal degree in co-relation 8194. Up to 1486 conditions per place. [2025-01-10 01:14:42,220 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 84 selfloop transitions, 38 changer transitions 0/123 dead transitions. [2025-01-10 01:14:42,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 123 transitions, 1585 flow [2025-01-10 01:14:42,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:14:42,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:14:42,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions. [2025-01-10 01:14:42,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-01-10 01:14:42,221 INFO L175 Difference]: Start difference. First operand has 94 places, 97 transitions, 1187 flow. Second operand 6 states and 171 transitions. [2025-01-10 01:14:42,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 123 transitions, 1585 flow [2025-01-10 01:14:42,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 123 transitions, 1521 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-01-10 01:14:42,240 INFO L231 Difference]: Finished difference. Result has 100 places, 100 transitions, 1285 flow [2025-01-10 01:14:42,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1099, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1285, PETRI_PLACES=100, PETRI_TRANSITIONS=100} [2025-01-10 01:14:42,241 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 53 predicate places. [2025-01-10 01:14:42,241 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 100 transitions, 1285 flow [2025-01-10 01:14:42,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:42,241 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:42,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:14:42,241 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:14:42,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:42,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1580756445, now seen corresponding path program 1 times [2025-01-10 01:14:42,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:42,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473462079] [2025-01-10 01:14:42,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:42,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:42,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:14:42,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:14:42,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:42,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:42,413 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:42,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:42,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473462079] [2025-01-10 01:14:42,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473462079] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:42,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:42,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 01:14:42,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377715031] [2025-01-10 01:14:42,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:42,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:14:42,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:42,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:14:42,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:14:42,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-01-10 01:14:42,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 100 transitions, 1285 flow. Second operand has 8 states, 8 states have (on average 20.625) internal successors, (165), 8 states have internal predecessors, (165), 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,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:42,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-01-10 01:14:42,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:43,153 INFO L124 PetriNetUnfolderBase]: 2031/3457 cut-off events. [2025-01-10 01:14:43,154 INFO L125 PetriNetUnfolderBase]: For 17453/17453 co-relation queries the response was YES. [2025-01-10 01:14:43,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15150 conditions, 3457 events. 2031/3457 cut-off events. For 17453/17453 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 20087 event pairs, 421 based on Foata normal form. 60/3517 useless extension candidates. Maximal degree in co-relation 13873. Up to 1002 conditions per place. [2025-01-10 01:14:43,174 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 231 selfloop transitions, 74 changer transitions 0/306 dead transitions. [2025-01-10 01:14:43,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 306 transitions, 3809 flow [2025-01-10 01:14:43,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:14:43,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:14:43,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 345 transitions. [2025-01-10 01:14:43,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6534090909090909 [2025-01-10 01:14:43,175 INFO L175 Difference]: Start difference. First operand has 100 places, 100 transitions, 1285 flow. Second operand 11 states and 345 transitions. [2025-01-10 01:14:43,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 306 transitions, 3809 flow [2025-01-10 01:14:43,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 306 transitions, 3627 flow, removed 31 selfloop flow, removed 2 redundant places. [2025-01-10 01:14:43,213 INFO L231 Difference]: Finished difference. Result has 116 places, 150 transitions, 2150 flow [2025-01-10 01:14:43,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1203, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2150, PETRI_PLACES=116, PETRI_TRANSITIONS=150} [2025-01-10 01:14:43,213 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 69 predicate places. [2025-01-10 01:14:43,213 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 150 transitions, 2150 flow [2025-01-10 01:14:43,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.625) internal successors, (165), 8 states have internal predecessors, (165), 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,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:43,214 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:43,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 01:14:43,214 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:14:43,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:43,214 INFO L85 PathProgramCache]: Analyzing trace with hash 958924583, now seen corresponding path program 2 times [2025-01-10 01:14:43,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:43,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519300033] [2025-01-10 01:14:43,215 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:43,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:43,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 01:14:43,224 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 22 statements. [2025-01-10 01:14:43,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:43,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:43,277 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:43,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:43,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519300033] [2025-01-10 01:14:43,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519300033] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:43,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:43,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:14:43,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10854110] [2025-01-10 01:14:43,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:43,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:14:43,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:43,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:14:43,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:14:43,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-01-10 01:14:43,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 150 transitions, 2150 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:43,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-01-10 01:14:43,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:43,645 INFO L124 PetriNetUnfolderBase]: 2007/3453 cut-off events. [2025-01-10 01:14:43,645 INFO L125 PetriNetUnfolderBase]: For 25554/25554 co-relation queries the response was YES. [2025-01-10 01:14:43,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17880 conditions, 3453 events. 2007/3453 cut-off events. For 25554/25554 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 19887 event pairs, 768 based on Foata normal form. 78/3531 useless extension candidates. Maximal degree in co-relation 16875. Up to 2060 conditions per place. [2025-01-10 01:14:43,666 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 164 selfloop transitions, 67 changer transitions 0/232 dead transitions. [2025-01-10 01:14:43,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 232 transitions, 3536 flow [2025-01-10 01:14:43,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:14:43,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:14:43,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2025-01-10 01:14:43,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5868055555555556 [2025-01-10 01:14:43,668 INFO L175 Difference]: Start difference. First operand has 116 places, 150 transitions, 2150 flow. Second operand 6 states and 169 transitions. [2025-01-10 01:14:43,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 232 transitions, 3536 flow [2025-01-10 01:14:43,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 232 transitions, 3403 flow, removed 33 selfloop flow, removed 1 redundant places. [2025-01-10 01:14:43,727 INFO L231 Difference]: Finished difference. Result has 123 places, 168 transitions, 2563 flow [2025-01-10 01:14:43,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2057, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2563, PETRI_PLACES=123, PETRI_TRANSITIONS=168} [2025-01-10 01:14:43,728 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 76 predicate places. [2025-01-10 01:14:43,728 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 168 transitions, 2563 flow [2025-01-10 01:14:43,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:43,728 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:43,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 01:14:43,729 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:14:43,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:43,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1645371125, now seen corresponding path program 1 times [2025-01-10 01:14:43,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:43,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191325415] [2025-01-10 01:14:43,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:43,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:43,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:14:43,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:14:43,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:43,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:43,810 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:43,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:43,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191325415] [2025-01-10 01:14:43,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191325415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:43,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:43,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:14:43,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923214815] [2025-01-10 01:14:43,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:43,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:14:43,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:43,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:14:43,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:14:43,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2025-01-10 01:14:43,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 168 transitions, 2563 flow. Second operand has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 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,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:43,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2025-01-10 01:14:43,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:44,422 INFO L124 PetriNetUnfolderBase]: 2146/3812 cut-off events. [2025-01-10 01:14:44,423 INFO L125 PetriNetUnfolderBase]: For 31856/31868 co-relation queries the response was YES. [2025-01-10 01:14:44,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20144 conditions, 3812 events. 2146/3812 cut-off events. For 31856/31868 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 23530 event pairs, 432 based on Foata normal form. 16/3822 useless extension candidates. Maximal degree in co-relation 19011. Up to 1015 conditions per place. [2025-01-10 01:14:44,480 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 259 selfloop transitions, 99 changer transitions 0/360 dead transitions. [2025-01-10 01:14:44,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 360 transitions, 4985 flow [2025-01-10 01:14:44,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:14:44,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 01:14:44,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 398 transitions. [2025-01-10 01:14:44,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6378205128205128 [2025-01-10 01:14:44,482 INFO L175 Difference]: Start difference. First operand has 123 places, 168 transitions, 2563 flow. Second operand 13 states and 398 transitions. [2025-01-10 01:14:44,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 360 transitions, 4985 flow [2025-01-10 01:14:44,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 360 transitions, 4817 flow, removed 16 selfloop flow, removed 3 redundant places. [2025-01-10 01:14:44,553 INFO L231 Difference]: Finished difference. Result has 139 places, 212 transitions, 3327 flow [2025-01-10 01:14:44,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2455, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3327, PETRI_PLACES=139, PETRI_TRANSITIONS=212} [2025-01-10 01:14:44,554 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 92 predicate places. [2025-01-10 01:14:44,554 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 212 transitions, 3327 flow [2025-01-10 01:14:44,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 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,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:44,554 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:44,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 01:14:44,555 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:14:44,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:44,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1228779229, now seen corresponding path program 1 times [2025-01-10 01:14:44,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:44,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983918438] [2025-01-10 01:14:44,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:44,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:44,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:14:44,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:14:44,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:44,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:44,715 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:44,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:44,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983918438] [2025-01-10 01:14:44,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983918438] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:44,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562849196] [2025-01-10 01:14:44,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:44,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:44,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:44,717 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:44,719 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:44,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:14:44,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:14:44,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:44,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:44,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-10 01:14:44,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:44,796 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:44,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:44,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:45,117 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 72 treesize of output 64 [2025-01-10 01:14:45,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:14:45,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 116 [2025-01-10 01:14:45,649 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:45,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562849196] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:45,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:45,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2025-01-10 01:14:45,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014725070] [2025-01-10 01:14:45,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:45,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 01:14:45,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:45,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 01:14:45,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:14:46,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-01-10 01:14:46,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 212 transitions, 3327 flow. Second operand has 21 states, 21 states have (on average 21.142857142857142) internal successors, (444), 21 states have internal predecessors, (444), 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,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:46,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-01-10 01:14:46,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:49,070 INFO L124 PetriNetUnfolderBase]: 5625/9630 cut-off events. [2025-01-10 01:14:49,070 INFO L125 PetriNetUnfolderBase]: For 78219/78219 co-relation queries the response was YES. [2025-01-10 01:14:49,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51653 conditions, 9630 events. 5625/9630 cut-off events. For 78219/78219 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 62569 event pairs, 154 based on Foata normal form. 53/9683 useless extension candidates. Maximal degree in co-relation 50734. Up to 1997 conditions per place. [2025-01-10 01:14:49,122 INFO L140 encePairwiseOnDemand]: 29/48 looper letters, 487 selfloop transitions, 248 changer transitions 268/1004 dead transitions. [2025-01-10 01:14:49,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 1004 transitions, 13249 flow [2025-01-10 01:14:49,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-01-10 01:14:49,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2025-01-10 01:14:49,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 1589 transitions. [2025-01-10 01:14:49,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5707614942528736 [2025-01-10 01:14:49,125 INFO L175 Difference]: Start difference. First operand has 139 places, 212 transitions, 3327 flow. Second operand 58 states and 1589 transitions. [2025-01-10 01:14:49,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 1004 transitions, 13249 flow [2025-01-10 01:14:49,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 1004 transitions, 12867 flow, removed 115 selfloop flow, removed 2 redundant places. [2025-01-10 01:14:49,327 INFO L231 Difference]: Finished difference. Result has 220 places, 361 transitions, 5495 flow [2025-01-10 01:14:49,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3208, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=5495, PETRI_PLACES=220, PETRI_TRANSITIONS=361} [2025-01-10 01:14:49,328 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 173 predicate places. [2025-01-10 01:14:49,328 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 361 transitions, 5495 flow [2025-01-10 01:14:49,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 21.142857142857142) internal successors, (444), 21 states have internal predecessors, (444), 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,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:49,328 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:49,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 01:14:49,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:49,529 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:14:49,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:49,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1202898117, now seen corresponding path program 2 times [2025-01-10 01:14:49,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:49,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933881898] [2025-01-10 01:14:49,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:49,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:49,534 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:14:49,546 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:14:49,546 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:14:49,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:49,651 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:49,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:49,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933881898] [2025-01-10 01:14:49,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933881898] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:49,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899476833] [2025-01-10 01:14:49,652 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:49,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:49,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:49,653 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:14:49,655 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:14:49,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:14:49,760 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:14:49,760 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:14:49,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:49,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:14:49,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:49,811 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:49,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:49,888 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:49,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899476833] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:49,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:49,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2025-01-10 01:14:49,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565157969] [2025-01-10 01:14:49,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:49,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:14:49,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:49,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:14:49,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:14:49,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-01-10 01:14:49,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 361 transitions, 5495 flow. Second operand has 16 states, 16 states have (on average 20.625) internal successors, (330), 16 states have internal predecessors, (330), 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,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:49,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-01-10 01:14:49,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:51,412 INFO L124 PetriNetUnfolderBase]: 4370/7597 cut-off events. [2025-01-10 01:14:51,413 INFO L125 PetriNetUnfolderBase]: For 75177/75177 co-relation queries the response was YES. [2025-01-10 01:14:51,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45249 conditions, 7597 events. 4370/7597 cut-off events. For 75177/75177 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 47901 event pairs, 1549 based on Foata normal form. 12/7609 useless extension candidates. Maximal degree in co-relation 45127. Up to 3918 conditions per place. [2025-01-10 01:14:51,471 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 399 selfloop transitions, 179 changer transitions 2/581 dead transitions. [2025-01-10 01:14:51,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 581 transitions, 8978 flow [2025-01-10 01:14:51,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 01:14:51,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-10 01:14:51,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 495 transitions. [2025-01-10 01:14:51,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5729166666666666 [2025-01-10 01:14:51,473 INFO L175 Difference]: Start difference. First operand has 220 places, 361 transitions, 5495 flow. Second operand 18 states and 495 transitions. [2025-01-10 01:14:51,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 581 transitions, 8978 flow [2025-01-10 01:14:51,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 581 transitions, 8267 flow, removed 331 selfloop flow, removed 15 redundant places. [2025-01-10 01:14:51,819 INFO L231 Difference]: Finished difference. Result has 220 places, 432 transitions, 6587 flow [2025-01-10 01:14:51,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4976, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6587, PETRI_PLACES=220, PETRI_TRANSITIONS=432} [2025-01-10 01:14:51,820 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 173 predicate places. [2025-01-10 01:14:51,820 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 432 transitions, 6587 flow [2025-01-10 01:14:51,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 20.625) internal successors, (330), 16 states have internal predecessors, (330), 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,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:51,820 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:51,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 01:14:52,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:52,020 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:14:52,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:52,021 INFO L85 PathProgramCache]: Analyzing trace with hash 572896559, now seen corresponding path program 3 times [2025-01-10 01:14:52,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:52,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46665653] [2025-01-10 01:14:52,021 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:14:52,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:52,025 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:14:52,031 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 23 statements. [2025-01-10 01:14:52,031 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:14:52,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:52,090 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,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:52,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46665653] [2025-01-10 01:14:52,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46665653] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:52,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:52,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:14:52,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548280700] [2025-01-10 01:14:52,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:52,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:14:52,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:52,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:14:52,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:14:52,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-01-10 01:14:52,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 432 transitions, 6587 flow. Second operand has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 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,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:52,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-01-10 01:14:52,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:53,501 INFO L124 PetriNetUnfolderBase]: 4493/7841 cut-off events. [2025-01-10 01:14:53,502 INFO L125 PetriNetUnfolderBase]: For 79756/79756 co-relation queries the response was YES. [2025-01-10 01:14:53,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47479 conditions, 7841 events. 4493/7841 cut-off events. For 79756/79756 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 49818 event pairs, 1957 based on Foata normal form. 24/7865 useless extension candidates. Maximal degree in co-relation 47269. Up to 5564 conditions per place. [2025-01-10 01:14:53,559 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 416 selfloop transitions, 139 changer transitions 10/566 dead transitions. [2025-01-10 01:14:53,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 566 transitions, 9144 flow [2025-01-10 01:14:53,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:14:53,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:14:53,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 295 transitions. [2025-01-10 01:14:53,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6145833333333334 [2025-01-10 01:14:53,560 INFO L175 Difference]: Start difference. First operand has 220 places, 432 transitions, 6587 flow. Second operand 10 states and 295 transitions. [2025-01-10 01:14:53,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 566 transitions, 9144 flow [2025-01-10 01:14:53,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 566 transitions, 8936 flow, removed 42 selfloop flow, removed 6 redundant places. [2025-01-10 01:14:53,924 INFO L231 Difference]: Finished difference. Result has 229 places, 456 transitions, 7282 flow [2025-01-10 01:14:53,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=6323, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7282, PETRI_PLACES=229, PETRI_TRANSITIONS=456} [2025-01-10 01:14:53,925 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 182 predicate places. [2025-01-10 01:14:53,925 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 456 transitions, 7282 flow [2025-01-10 01:14:53,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 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,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:53,925 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:53,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 01:14:53,925 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:14:53,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:53,925 INFO L85 PathProgramCache]: Analyzing trace with hash 274189767, now seen corresponding path program 4 times [2025-01-10 01:14:53,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:53,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116976059] [2025-01-10 01:14:53,926 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:14:53,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:53,930 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:14:53,940 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:14:53,940 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:14:53,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:54,078 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:54,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:54,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116976059] [2025-01-10 01:14:54,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116976059] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:54,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240107817] [2025-01-10 01:14:54,078 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:14:54,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:54,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:54,080 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:14:54,083 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:14:54,214 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:14:54,238 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:14:54,239 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:14:54,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:54,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:14:54,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:54,361 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,362 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:14:54,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240107817] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:54,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:14:54,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2025-01-10 01:14:54,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454426152] [2025-01-10 01:14:54,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:54,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:14:54,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:54,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:14:54,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:14:54,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2025-01-10 01:14:54,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 456 transitions, 7282 flow. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 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,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:54,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2025-01-10 01:14:54,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:55,830 INFO L124 PetriNetUnfolderBase]: 4340/7712 cut-off events. [2025-01-10 01:14:55,830 INFO L125 PetriNetUnfolderBase]: For 85385/85447 co-relation queries the response was YES. [2025-01-10 01:14:55,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48451 conditions, 7712 events. 4340/7712 cut-off events. For 85385/85447 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 50629 event pairs, 2157 based on Foata normal form. 44/7729 useless extension candidates. Maximal degree in co-relation 48200. Up to 5965 conditions per place. [2025-01-10 01:14:55,910 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 444 selfloop transitions, 108 changer transitions 0/564 dead transitions. [2025-01-10 01:14:55,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 564 transitions, 9826 flow [2025-01-10 01:14:55,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:14:55,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:14:55,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 263 transitions. [2025-01-10 01:14:55,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6087962962962963 [2025-01-10 01:14:55,911 INFO L175 Difference]: Start difference. First operand has 229 places, 456 transitions, 7282 flow. Second operand 9 states and 263 transitions. [2025-01-10 01:14:55,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 564 transitions, 9826 flow [2025-01-10 01:14:56,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 564 transitions, 9751 flow, removed 21 selfloop flow, removed 4 redundant places. [2025-01-10 01:14:56,285 INFO L231 Difference]: Finished difference. Result has 235 places, 484 transitions, 8046 flow [2025-01-10 01:14:56,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=7219, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8046, PETRI_PLACES=235, PETRI_TRANSITIONS=484} [2025-01-10 01:14:56,285 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 188 predicate places. [2025-01-10 01:14:56,286 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 484 transitions, 8046 flow [2025-01-10 01:14:56,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 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,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:56,286 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:56,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 01:14:56,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-10 01:14:56,490 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:14:56,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:56,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1259167953, now seen corresponding path program 5 times [2025-01-10 01:14:56,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:56,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813566339] [2025-01-10 01:14:56,491 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:14:56,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:56,495 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:14:56,501 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:14:56,501 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:14:56,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:56,632 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,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:56,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813566339] [2025-01-10 01:14:56,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813566339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:56,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:56,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:14:56,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090928627] [2025-01-10 01:14:56,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:56,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:14:56,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:56,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:14:56,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:14:59,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-10 01:14:59,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-01-10 01:14:59,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 484 transitions, 8046 flow. Second operand has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 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,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:59,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-01-10 01:14:59,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:03,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-10 01:15:04,310 INFO L124 PetriNetUnfolderBase]: 5110/8911 cut-off events. [2025-01-10 01:15:04,311 INFO L125 PetriNetUnfolderBase]: For 106303/106303 co-relation queries the response was YES. [2025-01-10 01:15:04,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57356 conditions, 8911 events. 5110/8911 cut-off events. For 106303/106303 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 58104 event pairs, 2505 based on Foata normal form. 44/8955 useless extension candidates. Maximal degree in co-relation 56014. Up to 6789 conditions per place. [2025-01-10 01:15:04,385 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 450 selfloop transitions, 200 changer transitions 1/652 dead transitions. [2025-01-10 01:15:04,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 652 transitions, 12276 flow [2025-01-10 01:15:04,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:15:04,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:15:04,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 213 transitions. [2025-01-10 01:15:04,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5546875 [2025-01-10 01:15:04,386 INFO L175 Difference]: Start difference. First operand has 235 places, 484 transitions, 8046 flow. Second operand 8 states and 213 transitions. [2025-01-10 01:15:04,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 652 transitions, 12276 flow [2025-01-10 01:15:04,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 652 transitions, 12021 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-01-10 01:15:04,860 INFO L231 Difference]: Finished difference. Result has 241 places, 577 transitions, 10549 flow [2025-01-10 01:15:04,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=7855, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10549, PETRI_PLACES=241, PETRI_TRANSITIONS=577} [2025-01-10 01:15:04,863 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 194 predicate places. [2025-01-10 01:15:04,863 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 577 transitions, 10549 flow [2025-01-10 01:15:04,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 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,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:04,863 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:04,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-10 01:15:04,863 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:15:04,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:04,864 INFO L85 PathProgramCache]: Analyzing trace with hash -272932743, now seen corresponding path program 6 times [2025-01-10 01:15:04,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:04,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255950573] [2025-01-10 01:15:04,864 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:15:04,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:04,868 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:15:04,879 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 21 of 23 statements. [2025-01-10 01:15:04,879 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 01:15:04,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:04,993 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:04,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:04,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255950573] [2025-01-10 01:15:04,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255950573] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:04,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:04,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:15:04,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244369516] [2025-01-10 01:15:04,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:04,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:15:04,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:04,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:15:04,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:15:05,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-01-10 01:15:05,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 577 transitions, 10549 flow. Second operand has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 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,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:05,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-01-10 01:15:05,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:06,911 INFO L124 PetriNetUnfolderBase]: 5184/9045 cut-off events. [2025-01-10 01:15:06,911 INFO L125 PetriNetUnfolderBase]: For 118950/118950 co-relation queries the response was YES. [2025-01-10 01:15:06,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60657 conditions, 9045 events. 5184/9045 cut-off events. For 118950/118950 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 59265 event pairs, 2058 based on Foata normal form. 28/9073 useless extension candidates. Maximal degree in co-relation 59272. Up to 5004 conditions per place. [2025-01-10 01:15:07,001 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 445 selfloop transitions, 249 changer transitions 1/696 dead transitions. [2025-01-10 01:15:07,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 696 transitions, 13574 flow [2025-01-10 01:15:07,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:15:07,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:15:07,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 241 transitions. [2025-01-10 01:15:07,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5578703703703703 [2025-01-10 01:15:07,002 INFO L175 Difference]: Start difference. First operand has 241 places, 577 transitions, 10549 flow. Second operand 9 states and 241 transitions. [2025-01-10 01:15:07,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 696 transitions, 13574 flow [2025-01-10 01:15:07,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 696 transitions, 13287 flow, removed 23 selfloop flow, removed 3 redundant places. [2025-01-10 01:15:07,661 INFO L231 Difference]: Finished difference. Result has 248 places, 600 transitions, 11377 flow [2025-01-10 01:15:07,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=10262, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11377, PETRI_PLACES=248, PETRI_TRANSITIONS=600} [2025-01-10 01:15:07,662 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 201 predicate places. [2025-01-10 01:15:07,662 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 600 transitions, 11377 flow [2025-01-10 01:15:07,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 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:07,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:07,662 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:07,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-10 01:15:07,662 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:15:07,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:07,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1081965197, now seen corresponding path program 7 times [2025-01-10 01:15:07,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:07,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371228479] [2025-01-10 01:15:07,663 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:15:07,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:07,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:15:07,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:15:07,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:07,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:07,756 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:15:07,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:07,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371228479] [2025-01-10 01:15:07,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371228479] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:15:07,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840074230] [2025-01-10 01:15:07,756 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:15:07,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:15:07,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:15:07,759 INFO L229 MonitoredProcess]: Starting monitored process 12 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:07,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 01:15:07,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:15:07,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:15:07,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:07,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:07,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:15:07,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:15:07,858 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:15:07,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:15:07,924 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:15:07,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840074230] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:15:07,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:15:07,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-01-10 01:15:07,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131216865] [2025-01-10 01:15:07,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:15:07,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:15:07,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:07,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:15:07,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:15:07,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-01-10 01:15:07,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 600 transitions, 11377 flow. Second operand has 12 states, 12 states have (on average 20.75) internal successors, (249), 12 states have internal predecessors, (249), 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:07,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:07,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-01-10 01:15:07,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:10,159 INFO L124 PetriNetUnfolderBase]: 5719/10036 cut-off events. [2025-01-10 01:15:10,159 INFO L125 PetriNetUnfolderBase]: For 148390/148390 co-relation queries the response was YES. [2025-01-10 01:15:10,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69905 conditions, 10036 events. 5719/10036 cut-off events. For 148390/148390 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 67825 event pairs, 1251 based on Foata normal form. 24/10060 useless extension candidates. Maximal degree in co-relation 68800. Up to 4017 conditions per place. [2025-01-10 01:15:10,410 INFO L140 encePairwiseOnDemand]: 33/48 looper letters, 531 selfloop transitions, 417 changer transitions 14/963 dead transitions. [2025-01-10 01:15:10,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 963 transitions, 18542 flow [2025-01-10 01:15:10,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 01:15:10,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-01-10 01:15:10,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 579 transitions. [2025-01-10 01:15:10,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5482954545454546 [2025-01-10 01:15:10,411 INFO L175 Difference]: Start difference. First operand has 248 places, 600 transitions, 11377 flow. Second operand 22 states and 579 transitions. [2025-01-10 01:15:10,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 963 transitions, 18542 flow [2025-01-10 01:15:11,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 963 transitions, 18119 flow, removed 52 selfloop flow, removed 7 redundant places. [2025-01-10 01:15:11,142 INFO L231 Difference]: Finished difference. Result has 270 places, 751 transitions, 15210 flow [2025-01-10 01:15:11,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=11045, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=274, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=15210, PETRI_PLACES=270, PETRI_TRANSITIONS=751} [2025-01-10 01:15:11,143 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 223 predicate places. [2025-01-10 01:15:11,143 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 751 transitions, 15210 flow [2025-01-10 01:15:11,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.75) internal successors, (249), 12 states have internal predecessors, (249), 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:11,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:11,143 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:11,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 01:15:11,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-10 01:15:11,344 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:15:11,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:11,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1309031283, now seen corresponding path program 8 times [2025-01-10 01:15:11,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:11,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489879374] [2025-01-10 01:15:11,344 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:15:11,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:11,348 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:15:11,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:15:11,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:15:11,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:11,503 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:15:11,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:11,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489879374] [2025-01-10 01:15:11,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489879374] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:15:11,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809956136] [2025-01-10 01:15:11,503 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:15:11,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:15:11,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:15:11,505 INFO L229 MonitoredProcess]: Starting monitored process 13 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:11,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 01:15:11,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:15:11,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:15:11,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:15:11,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:11,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:15:11,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:15:11,607 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:15:11,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:15:11,689 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:15:11,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809956136] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:15:11,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:15:11,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2025-01-10 01:15:11,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404007133] [2025-01-10 01:15:11,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:15:11,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:15:11,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:11,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:15:11,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:15:11,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-01-10 01:15:11,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 751 transitions, 15210 flow. Second operand has 17 states, 17 states have (on average 20.470588235294116) internal successors, (348), 17 states have internal predecessors, (348), 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:11,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:11,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-01-10 01:15:11,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:16,232 INFO L124 PetriNetUnfolderBase]: 7190/12672 cut-off events. [2025-01-10 01:15:16,232 INFO L125 PetriNetUnfolderBase]: For 208748/208748 co-relation queries the response was YES. [2025-01-10 01:15:16,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91789 conditions, 12672 events. 7190/12672 cut-off events. For 208748/208748 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 90198 event pairs, 968 based on Foata normal form. 40/12712 useless extension candidates. Maximal degree in co-relation 90834. Up to 3424 conditions per place. [2025-01-10 01:15:16,356 INFO L140 encePairwiseOnDemand]: 31/48 looper letters, 351 selfloop transitions, 1106 changer transitions 0/1458 dead transitions. [2025-01-10 01:15:16,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 1458 transitions, 28622 flow [2025-01-10 01:15:16,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-10 01:15:16,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-01-10 01:15:16,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 867 transitions. [2025-01-10 01:15:16,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.564453125 [2025-01-10 01:15:16,358 INFO L175 Difference]: Start difference. First operand has 270 places, 751 transitions, 15210 flow. Second operand 32 states and 867 transitions. [2025-01-10 01:15:16,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 1458 transitions, 28622 flow [2025-01-10 01:15:18,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 1458 transitions, 26984 flow, removed 444 selfloop flow, removed 8 redundant places. [2025-01-10 01:15:18,168 INFO L231 Difference]: Finished difference. Result has 309 places, 1260 transitions, 26347 flow [2025-01-10 01:15:18,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=14019, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=746, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=619, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=26347, PETRI_PLACES=309, PETRI_TRANSITIONS=1260} [2025-01-10 01:15:18,169 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 262 predicate places. [2025-01-10 01:15:18,169 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 1260 transitions, 26347 flow [2025-01-10 01:15:18,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 20.470588235294116) internal successors, (348), 17 states have internal predecessors, (348), 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:18,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:18,169 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:18,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 01:15:18,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:15:18,370 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:15:18,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:18,371 INFO L85 PathProgramCache]: Analyzing trace with hash 298801563, now seen corresponding path program 9 times [2025-01-10 01:15:18,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:18,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078367516] [2025-01-10 01:15:18,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:15:18,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:18,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:15:18,383 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 23 statements. [2025-01-10 01:15:18,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:15:18,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:18,660 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:18,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:18,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078367516] [2025-01-10 01:15:18,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078367516] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:18,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:18,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:15:18,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671271912] [2025-01-10 01:15:18,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:18,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:15:18,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:18,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:15:18,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:15:20,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-10 01:15:24,203 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:15:26,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-10 01:15:26,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-01-10 01:15:26,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 1260 transitions, 26347 flow. Second operand has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 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:26,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:26,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-01-10 01:15:26,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:28,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-10 01:15:34,393 INFO L124 PetriNetUnfolderBase]: 7272/12759 cut-off events. [2025-01-10 01:15:34,394 INFO L125 PetriNetUnfolderBase]: For 250745/250745 co-relation queries the response was YES. [2025-01-10 01:15:34,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102507 conditions, 12759 events. 7272/12759 cut-off events. For 250745/250745 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 90066 event pairs, 3104 based on Foata normal form. 32/12791 useless extension candidates. Maximal degree in co-relation 101446. Up to 10638 conditions per place. [2025-01-10 01:15:34,522 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 1129 selfloop transitions, 216 changer transitions 0/1346 dead transitions. [2025-01-10 01:15:34,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 1346 transitions, 30689 flow [2025-01-10 01:15:34,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:15:34,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:15:34,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 216 transitions. [2025-01-10 01:15:34,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-01-10 01:15:34,523 INFO L175 Difference]: Start difference. First operand has 309 places, 1260 transitions, 26347 flow. Second operand 8 states and 216 transitions. [2025-01-10 01:15:34,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 1346 transitions, 30689 flow [2025-01-10 01:15:37,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 1346 transitions, 29152 flow, removed 620 selfloop flow, removed 6 redundant places. [2025-01-10 01:15:37,300 INFO L231 Difference]: Finished difference. Result has 312 places, 1288 transitions, 26211 flow [2025-01-10 01:15:37,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=24738, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1045, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=26211, PETRI_PLACES=312, PETRI_TRANSITIONS=1288} [2025-01-10 01:15:37,302 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 265 predicate places. [2025-01-10 01:15:37,302 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 1288 transitions, 26211 flow [2025-01-10 01:15:37,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 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:37,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:37,302 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] [2025-01-10 01:15:37,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-10 01:15:37,303 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:15:37,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:37,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1278272094, now seen corresponding path program 10 times [2025-01-10 01:15:37,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:37,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183193744] [2025-01-10 01:15:37,303 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:15:37,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:37,308 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-01-10 01:15:37,316 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:37,317 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:15:37,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:37,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:37,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:37,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183193744] [2025-01-10 01:15:37,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183193744] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:15:37,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019491108] [2025-01-10 01:15:37,489 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:15:37,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:15:37,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:15:37,491 INFO L229 MonitoredProcess]: Starting monitored process 14 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:37,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 01:15:37,534 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-01-10 01:15:37,556 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:37,556 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:15:37,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:37,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-10 01:15:37,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:15:37,601 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:37,757 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:15:37,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:15:37,917 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 124 treesize of output 110 [2025-01-10 01:15:38,009 INFO L349 Elim1Store]: treesize reduction 5, result has 95.2 percent of original size [2025-01-10 01:15:38,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 472 treesize of output 383 [2025-01-10 01:15:40,153 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:15:40,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019491108] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:15:40,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:15:40,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 9] total 22 [2025-01-10 01:15:40,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743439781] [2025-01-10 01:15:40,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:15:40,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 01:15:40,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:40,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 01:15:40,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2025-01-10 01:15:40,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2025-01-10 01:15:40,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 1288 transitions, 26211 flow. Second operand has 23 states, 23 states have (on average 23.82608695652174) internal successors, (548), 23 states have internal predecessors, (548), 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:40,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:40,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2025-01-10 01:15:40,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:45,336 INFO L124 PetriNetUnfolderBase]: 7608/13753 cut-off events. [2025-01-10 01:15:45,336 INFO L125 PetriNetUnfolderBase]: For 234555/234729 co-relation queries the response was YES. [2025-01-10 01:15:45,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104777 conditions, 13753 events. 7608/13753 cut-off events. For 234555/234729 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 101793 event pairs, 838 based on Foata normal form. 32/13722 useless extension candidates. Maximal degree in co-relation 104083. Up to 4887 conditions per place. [2025-01-10 01:15:45,516 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 603 selfloop transitions, 378 changer transitions 636/1660 dead transitions. [2025-01-10 01:15:45,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 1660 transitions, 35011 flow [2025-01-10 01:15:45,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 01:15:45,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-01-10 01:15:45,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 659 transitions. [2025-01-10 01:15:45,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6240530303030303 [2025-01-10 01:15:45,518 INFO L175 Difference]: Start difference. First operand has 312 places, 1288 transitions, 26211 flow. Second operand 22 states and 659 transitions. [2025-01-10 01:15:45,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 1660 transitions, 35011 flow [2025-01-10 01:15:48,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 1660 transitions, 34717 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-01-10 01:15:48,112 INFO L231 Difference]: Finished difference. Result has 334 places, 936 transitions, 18833 flow [2025-01-10 01:15:48,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=25937, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=324, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=957, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=18833, PETRI_PLACES=334, PETRI_TRANSITIONS=936} [2025-01-10 01:15:48,113 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 287 predicate places. [2025-01-10 01:15:48,114 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 936 transitions, 18833 flow [2025-01-10 01:15:48,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 23.82608695652174) internal successors, (548), 23 states have internal predecessors, (548), 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:48,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:48,114 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] [2025-01-10 01:15:48,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-10 01:15:48,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:15:48,318 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:15:48,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:48,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1461586477, now seen corresponding path program 2 times [2025-01-10 01:15:48,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:48,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804337846] [2025-01-10 01:15:48,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:15:48,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:48,323 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-10 01:15:48,326 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 25 statements. [2025-01-10 01:15:48,326 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:15:48,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:48,430 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:48,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:48,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804337846] [2025-01-10 01:15:48,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804337846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:48,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:48,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 01:15:48,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568856838] [2025-01-10 01:15:48,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:48,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:15:48,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:48,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:15:48,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:15:48,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2025-01-10 01:15:48,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 936 transitions, 18833 flow. Second operand has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 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:48,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:48,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2025-01-10 01:15:48,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:51,251 INFO L124 PetriNetUnfolderBase]: 5372/9479 cut-off events. [2025-01-10 01:15:51,252 INFO L125 PetriNetUnfolderBase]: For 169345/169401 co-relation queries the response was YES. [2025-01-10 01:15:51,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73395 conditions, 9479 events. 5372/9479 cut-off events. For 169345/169401 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 64224 event pairs, 2243 based on Foata normal form. 3/9465 useless extension candidates. Maximal degree in co-relation 73276. Up to 7437 conditions per place. [2025-01-10 01:15:51,396 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 925 selfloop transitions, 90 changer transitions 0/1019 dead transitions. [2025-01-10 01:15:51,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 1019 transitions, 22077 flow [2025-01-10 01:15:51,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:15:51,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:15:51,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 229 transitions. [2025-01-10 01:15:51,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5963541666666666 [2025-01-10 01:15:51,401 INFO L175 Difference]: Start difference. First operand has 334 places, 936 transitions, 18833 flow. Second operand 8 states and 229 transitions. [2025-01-10 01:15:51,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 1019 transitions, 22077 flow [2025-01-10 01:15:53,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 1019 transitions, 20763 flow, removed 611 selfloop flow, removed 16 redundant places. [2025-01-10 01:15:53,283 INFO L231 Difference]: Finished difference. Result has 294 places, 938 transitions, 17834 flow [2025-01-10 01:15:53,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=17603, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=936, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=846, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=17834, PETRI_PLACES=294, PETRI_TRANSITIONS=938} [2025-01-10 01:15:53,284 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 247 predicate places. [2025-01-10 01:15:53,284 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 938 transitions, 17834 flow [2025-01-10 01:15:53,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 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:53,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:53,284 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] [2025-01-10 01:15:53,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-10 01:15:53,284 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 01:15:53,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:53,285 INFO L85 PathProgramCache]: Analyzing trace with hash 172204303, now seen corresponding path program 3 times [2025-01-10 01:15:53,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:53,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512850126] [2025-01-10 01:15:53,285 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:15:53,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:53,291 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-01-10 01:15:53,303 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 25 statements. [2025-01-10 01:15:53,303 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:15:53,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:53,609 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:53,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:53,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512850126] [2025-01-10 01:15:53,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512850126] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:15:53,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697966967] [2025-01-10 01:15:53,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:15:53,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:15:53,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:15:53,612 INFO L229 MonitoredProcess]: Starting monitored process 15 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:53,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 01:15:53,651 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-01-10 01:15:53,677 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 25 statements. [2025-01-10 01:15:53,677 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:15:53,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:53,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 01:15:53,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:15:53,749 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:53,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:15:53,907 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:53,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697966967] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:15:53,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:15:53,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2025-01-10 01:15:53,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436861826] [2025-01-10 01:15:53,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:15:53,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 01:15:53,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:53,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 01:15:53,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2025-01-10 01:15:53,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-01-10 01:15:53,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 938 transitions, 17834 flow. Second operand has 20 states, 20 states have (on average 19.8) internal successors, (396), 20 states have internal predecessors, (396), 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:53,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:53,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-01-10 01:15:53,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand