./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.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 5dd003755f1e361f3bbf00c3bfecbc1131b6df98a7806f5bb08971966b13d6ac --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:10:32,106 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:10:32,141 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:10:32,145 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:10:32,145 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:10:32,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:10:32,160 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:10:32,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:10:32,161 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:10:32,161 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:10:32,161 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:10:32,161 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:10:32,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:10:32,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:10:32,161 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:10:32,161 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:10:32,161 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:10:32,162 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:10:32,162 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:10:32,162 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:10:32,162 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:10:32,162 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:10:32,162 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:10:32,162 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:10:32,162 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:10:32,162 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:10:32,162 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:10:32,162 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:10:32,163 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:10:32,163 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:10:32,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:10:32,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:10:32,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:10:32,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:10:32,163 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:10:32,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:10:32,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:10:32,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:10:32,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:10:32,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:10:32,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:10:32,164 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:10:32,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:10:32,164 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:10:32,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:10:32,164 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:10:32,164 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:10:32,164 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 -> 5dd003755f1e361f3bbf00c3bfecbc1131b6df98a7806f5bb08971966b13d6ac [2025-01-10 01:10:32,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:10:32,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:10:32,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:10:32,342 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:10:32,342 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:10:32,343 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c [2025-01-10 01:10:33,481 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c45288724/c636927878a942a3894dd07b609c232b/FLAG287e578e3 [2025-01-10 01:10:33,825 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:10:33,825 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c [2025-01-10 01:10:33,850 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c45288724/c636927878a942a3894dd07b609c232b/FLAG287e578e3 [2025-01-10 01:10:34,071 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c45288724/c636927878a942a3894dd07b609c232b [2025-01-10 01:10:34,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:10:34,075 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:10:34,076 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:10:34,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:10:34,080 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:10:34,080 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:10:34" (1/1) ... [2025-01-10 01:10:34,081 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a46a5f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:34, skipping insertion in model container [2025-01-10 01:10:34,081 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:10:34" (1/1) ... [2025-01-10 01:10:34,096 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:10:34,241 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:10:34,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:10:34,251 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:10:34,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:10:34,291 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:10:34,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:34 WrapperNode [2025-01-10 01:10:34,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:10:34,293 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:10:34,293 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:10:34,294 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:10:34,297 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:10:34" (1/1) ... [2025-01-10 01:10:34,305 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:10:34" (1/1) ... [2025-01-10 01:10:34,325 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 17, calls inlined = 19, statements flattened = 239 [2025-01-10 01:10:34,327 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:10:34,328 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:10:34,328 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:10:34,328 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:10:34,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:34" (1/1) ... [2025-01-10 01:10:34,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:34" (1/1) ... [2025-01-10 01:10:34,337 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:34" (1/1) ... [2025-01-10 01:10:34,354 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 2 writes are split as follows [0, 2]. [2025-01-10 01:10:34,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:34" (1/1) ... [2025-01-10 01:10:34,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:34" (1/1) ... [2025-01-10 01:10:34,361 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:34" (1/1) ... [2025-01-10 01:10:34,369 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:34" (1/1) ... [2025-01-10 01:10:34,371 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:34" (1/1) ... [2025-01-10 01:10:34,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:34" (1/1) ... [2025-01-10 01:10:34,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:34" (1/1) ... [2025-01-10 01:10:34,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:10:34,378 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:10:34,378 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:10:34,378 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:10:34,379 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:34" (1/1) ... [2025-01-10 01:10:34,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:10:34,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:34,404 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:10:34,407 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:10:34,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:10:34,424 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:10:34,424 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:10:34,424 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:10:34,424 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:10:34,424 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:10:34,424 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:10:34,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:10:34,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:10:34,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:10:34,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:10:34,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 01:10:34,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 01:10:34,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:10:34,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:10:34,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:10:34,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:10:34,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:10:34,427 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:10:34,519 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:10:34,521 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:10:34,970 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:10:34,971 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:10:35,220 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:10:35,221 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 01:10:35,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:10:35 BoogieIcfgContainer [2025-01-10 01:10:35,221 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:10:35,223 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:10:35,223 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:10:35,227 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:10:35,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:10:34" (1/3) ... [2025-01-10 01:10:35,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21899c51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:10:35, skipping insertion in model container [2025-01-10 01:10:35,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:34" (2/3) ... [2025-01-10 01:10:35,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21899c51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:10:35, skipping insertion in model container [2025-01-10 01:10:35,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:10:35" (3/3) ... [2025-01-10 01:10:35,230 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-3-nl.wvr.c [2025-01-10 01:10:35,244 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:10:35,245 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-queue-add-3-nl.wvr.c that has 4 procedures, 54 locations, 1 initial locations, 5 loop locations, and 16 error locations. [2025-01-10 01:10:35,245 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:10:35,299 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 01:10:35,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 60 transitions, 141 flow [2025-01-10 01:10:35,390 INFO L124 PetriNetUnfolderBase]: 7/57 cut-off events. [2025-01-10 01:10:35,392 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:10:35,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 57 events. 7/57 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 140 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-01-10 01:10:35,395 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 60 transitions, 141 flow [2025-01-10 01:10:35,397 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 56 transitions, 130 flow [2025-01-10 01:10:35,403 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:10:35,415 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;@6ec0c7aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:10:35,415 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-01-10 01:10:35,420 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:10:35,421 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:10:35,421 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:10:35,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:35,422 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:10:35,422 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:10:35,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:35,428 INFO L85 PathProgramCache]: Analyzing trace with hash 719993, now seen corresponding path program 1 times [2025-01-10 01:10:35,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:35,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474571812] [2025-01-10 01:10:35,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:35,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:35,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:10:35,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:10:35,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:35,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:35,627 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:10:35,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:35,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474571812] [2025-01-10 01:10:35,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474571812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:35,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:35,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:10:35,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705843486] [2025-01-10 01:10:35,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:35,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:10:35,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:35,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:10:35,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:10:35,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-01-10 01:10:35,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:35,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:35,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-01-10 01:10:35,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:36,400 INFO L124 PetriNetUnfolderBase]: 4012/6040 cut-off events. [2025-01-10 01:10:36,400 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-01-10 01:10:36,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11741 conditions, 6040 events. 4012/6040 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 33634 event pairs, 3528 based on Foata normal form. 1/3960 useless extension candidates. Maximal degree in co-relation 11221. Up to 5391 conditions per place. [2025-01-10 01:10:36,436 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 40 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2025-01-10 01:10:36,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 50 transitions, 202 flow [2025-01-10 01:10:36,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:10:36,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:10:36,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2025-01-10 01:10:36,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46111111111111114 [2025-01-10 01:10:36,447 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 130 flow. Second operand 3 states and 83 transitions. [2025-01-10 01:10:36,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 50 transitions, 202 flow [2025-01-10 01:10:36,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 190 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:10:36,458 INFO L231 Difference]: Finished difference. Result has 51 places, 50 transitions, 110 flow [2025-01-10 01:10:36,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2025-01-10 01:10:36,463 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -8 predicate places. [2025-01-10 01:10:36,463 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 110 flow [2025-01-10 01:10:36,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:36,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:36,464 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:10:36,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:10:36,464 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:10:36,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:36,465 INFO L85 PathProgramCache]: Analyzing trace with hash 719994, now seen corresponding path program 1 times [2025-01-10 01:10:36,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:36,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944524019] [2025-01-10 01:10:36,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:36,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:36,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:10:36,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:10:36,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:36,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:36,742 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:10:36,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:36,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944524019] [2025-01-10 01:10:36,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944524019] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:36,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:36,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:10:36,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8755647] [2025-01-10 01:10:36,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:36,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:10:36,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:36,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:10:36,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:10:36,756 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-01-10 01:10:36,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:10:36,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:36,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-01-10 01:10:36,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:37,247 INFO L124 PetriNetUnfolderBase]: 4013/6043 cut-off events. [2025-01-10 01:10:37,247 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-01-10 01:10:37,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11560 conditions, 6043 events. 4013/6043 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 33639 event pairs, 3528 based on Foata normal form. 0/3960 useless extension candidates. Maximal degree in co-relation 11531. Up to 5400 conditions per place. [2025-01-10 01:10:37,290 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 43 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2025-01-10 01:10:37,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 53 transitions, 210 flow [2025-01-10 01:10:37,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:10:37,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:10:37,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-01-10 01:10:37,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-01-10 01:10:37,292 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 110 flow. Second operand 4 states and 96 transitions. [2025-01-10 01:10:37,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 53 transitions, 210 flow [2025-01-10 01:10:37,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:10:37,294 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 133 flow [2025-01-10 01:10:37,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2025-01-10 01:10:37,295 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -5 predicate places. [2025-01-10 01:10:37,295 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 133 flow [2025-01-10 01:10:37,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:10:37,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:37,296 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:10:37,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:10:37,296 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:10:37,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:37,296 INFO L85 PathProgramCache]: Analyzing trace with hash 22322427, now seen corresponding path program 1 times [2025-01-10 01:10:37,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:37,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381326212] [2025-01-10 01:10:37,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:37,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:37,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:10:37,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:10:37,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:37,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:37,595 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:10:37,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:37,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381326212] [2025-01-10 01:10:37,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381326212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:37,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:37,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:10:37,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858645196] [2025-01-10 01:10:37,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:37,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:10:37,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:37,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:10:37,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:10:37,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-01-10 01:10:37,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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:10:37,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:37,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-01-10 01:10:37,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:38,018 INFO L124 PetriNetUnfolderBase]: 4014/6046 cut-off events. [2025-01-10 01:10:38,018 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-01-10 01:10:38,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11577 conditions, 6046 events. 4014/6046 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 33594 event pairs, 3528 based on Foata normal form. 0/3962 useless extension candidates. Maximal degree in co-relation 11552. Up to 5399 conditions per place. [2025-01-10 01:10:38,095 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 43 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2025-01-10 01:10:38,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 56 transitions, 239 flow [2025-01-10 01:10:38,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:10:38,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:10:38,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2025-01-10 01:10:38,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37 [2025-01-10 01:10:38,097 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 133 flow. Second operand 5 states and 111 transitions. [2025-01-10 01:10:38,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 56 transitions, 239 flow [2025-01-10 01:10:38,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:10:38,098 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 167 flow [2025-01-10 01:10:38,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2025-01-10 01:10:38,099 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 0 predicate places. [2025-01-10 01:10:38,099 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 167 flow [2025-01-10 01:10:38,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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:10:38,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:38,099 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:10:38,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:10:38,099 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:10:38,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:38,104 INFO L85 PathProgramCache]: Analyzing trace with hash 691938464, now seen corresponding path program 1 times [2025-01-10 01:10:38,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:38,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563158446] [2025-01-10 01:10:38,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:38,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:38,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:10:38,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:10:38,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:38,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:38,310 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:10:38,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:38,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563158446] [2025-01-10 01:10:38,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563158446] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:38,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836566760] [2025-01-10 01:10:38,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:38,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:38,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:38,315 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:10:38,325 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:10:38,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:10:38,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:10:38,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:38,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:38,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:10:38,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:38,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-01-10 01:10:38,589 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:10:38,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:38,683 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:10:38,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836566760] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:38,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:38,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:10:38,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571631302] [2025-01-10 01:10:38,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:38,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:10:38,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:38,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:10:38,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:10:38,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-01-10 01:10:38,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 167 flow. Second operand has 11 states, 11 states have (on average 13.363636363636363) internal successors, (147), 11 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:38,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:38,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-01-10 01:10:38,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:39,305 INFO L124 PetriNetUnfolderBase]: 4014/6045 cut-off events. [2025-01-10 01:10:39,305 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-01-10 01:10:39,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11590 conditions, 6045 events. 4014/6045 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 33599 event pairs, 3528 based on Foata normal form. 0/3964 useless extension candidates. Maximal degree in co-relation 11562. Up to 5399 conditions per place. [2025-01-10 01:10:39,346 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 42 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2025-01-10 01:10:39,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 55 transitions, 261 flow [2025-01-10 01:10:39,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:10:39,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:10:39,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2025-01-10 01:10:39,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33055555555555555 [2025-01-10 01:10:39,348 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 167 flow. Second operand 6 states and 119 transitions. [2025-01-10 01:10:39,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 55 transitions, 261 flow [2025-01-10 01:10:39,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 55 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:10:39,349 INFO L231 Difference]: Finished difference. Result has 62 places, 55 transitions, 176 flow [2025-01-10 01:10:39,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=62, PETRI_TRANSITIONS=55} [2025-01-10 01:10:39,350 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 3 predicate places. [2025-01-10 01:10:39,350 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 176 flow [2025-01-10 01:10:39,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.363636363636363) internal successors, (147), 11 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:39,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:39,352 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 01:10:39,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:10:39,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:39,557 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:10:39,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:39,558 INFO L85 PathProgramCache]: Analyzing trace with hash -22959789, now seen corresponding path program 1 times [2025-01-10 01:10:39,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:39,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573306551] [2025-01-10 01:10:39,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:39,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:39,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:10:39,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:10:39,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:39,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:39,828 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:10:39,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:39,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573306551] [2025-01-10 01:10:39,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573306551] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:39,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247053206] [2025-01-10 01:10:39,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:39,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:39,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:39,833 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:10:39,836 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:10:39,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:10:39,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:10:39,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:39,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:39,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 01:10:39,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:39,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-01-10 01:10:40,122 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:10:40,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:40,306 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:10:40,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247053206] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:40,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:40,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-01-10 01:10:40,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191660553] [2025-01-10 01:10:40,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:40,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:10:40,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:40,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:10:40,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:10:40,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-01-10 01:10:40,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 176 flow. Second operand has 13 states, 13 states have (on average 13.307692307692308) internal successors, (173), 13 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:10:40,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:40,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-01-10 01:10:40,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:40,997 INFO L124 PetriNetUnfolderBase]: 4014/6044 cut-off events. [2025-01-10 01:10:40,997 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-01-10 01:10:41,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11594 conditions, 6044 events. 4014/6044 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 33607 event pairs, 3528 based on Foata normal form. 0/3964 useless extension candidates. Maximal degree in co-relation 11561. Up to 5391 conditions per place. [2025-01-10 01:10:41,019 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 36 selfloop transitions, 12 changer transitions 0/54 dead transitions. [2025-01-10 01:10:41,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 54 transitions, 268 flow [2025-01-10 01:10:41,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:10:41,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:10:41,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2025-01-10 01:10:41,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31666666666666665 [2025-01-10 01:10:41,021 INFO L175 Difference]: Start difference. First operand has 62 places, 55 transitions, 176 flow. Second operand 7 states and 133 transitions. [2025-01-10 01:10:41,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 54 transitions, 268 flow [2025-01-10 01:10:41,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 54 transitions, 234 flow, removed 3 selfloop flow, removed 8 redundant places. [2025-01-10 01:10:41,022 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 162 flow [2025-01-10 01:10:41,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=162, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2025-01-10 01:10:41,023 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 0 predicate places. [2025-01-10 01:10:41,023 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 162 flow [2025-01-10 01:10:41,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.307692307692308) internal successors, (173), 13 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:10:41,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:41,023 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:41,029 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:10:41,224 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:10:41,224 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:10:41,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:41,224 INFO L85 PathProgramCache]: Analyzing trace with hash -708441641, now seen corresponding path program 1 times [2025-01-10 01:10:41,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:41,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647742899] [2025-01-10 01:10:41,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:41,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:41,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:10:41,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:10:41,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:41,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:41,279 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:10:41,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:41,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647742899] [2025-01-10 01:10:41,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647742899] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:41,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:41,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:10:41,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330765742] [2025-01-10 01:10:41,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:41,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:10:41,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:41,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:10:41,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:10:41,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-01-10 01:10:41,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:10:41,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:41,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-01-10 01:10:41,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:41,703 INFO L124 PetriNetUnfolderBase]: 4174/6324 cut-off events. [2025-01-10 01:10:41,703 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-01-10 01:10:41,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12144 conditions, 6324 events. 4174/6324 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 35319 event pairs, 3675 based on Foata normal form. 115/4323 useless extension candidates. Maximal degree in co-relation 11545. Up to 5400 conditions per place. [2025-01-10 01:10:41,733 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 63 selfloop transitions, 5 changer transitions 1/75 dead transitions. [2025-01-10 01:10:41,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 75 transitions, 371 flow [2025-01-10 01:10:41,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:10:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:10:41,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2025-01-10 01:10:41,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2025-01-10 01:10:41,735 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 162 flow. Second operand 5 states and 145 transitions. [2025-01-10 01:10:41,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 75 transitions, 371 flow [2025-01-10 01:10:41,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 75 transitions, 332 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-01-10 01:10:41,737 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 182 flow [2025-01-10 01:10:41,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=182, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2025-01-10 01:10:41,738 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 1 predicate places. [2025-01-10 01:10:41,738 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 182 flow [2025-01-10 01:10:41,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:10:41,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:41,738 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:41,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:10:41,739 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:10:41,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:41,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1664921341, now seen corresponding path program 1 times [2025-01-10 01:10:41,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:41,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466389538] [2025-01-10 01:10:41,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:41,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:41,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:10:41,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:10:41,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:41,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:41,979 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:41,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:41,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466389538] [2025-01-10 01:10:41,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466389538] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:41,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018232368] [2025-01-10 01:10:41,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:41,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:41,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:41,981 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:10:41,987 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:10:42,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:10:42,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:10:42,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:42,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:42,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:10:42,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:42,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:10:42,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:10:42,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 01:10:42,158 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:10:42,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:10:42,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:42,189 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:10:42,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018232368] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:42,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:10:42,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2025-01-10 01:10:42,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385877846] [2025-01-10 01:10:42,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:42,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:10:42,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:42,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:10:42,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:10:42,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-01-10 01:10:42,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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:10:42,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:42,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-01-10 01:10:42,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:42,562 INFO L124 PetriNetUnfolderBase]: 3025/4588 cut-off events. [2025-01-10 01:10:42,562 INFO L125 PetriNetUnfolderBase]: For 410/410 co-relation queries the response was YES. [2025-01-10 01:10:42,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9742 conditions, 4588 events. 3025/4588 cut-off events. For 410/410 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 24028 event pairs, 2670 based on Foata normal form. 0/3303 useless extension candidates. Maximal degree in co-relation 9168. Up to 4172 conditions per place. [2025-01-10 01:10:42,581 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 44 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2025-01-10 01:10:42,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 53 transitions, 264 flow [2025-01-10 01:10:42,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:10:42,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:10:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2025-01-10 01:10:42,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-01-10 01:10:42,584 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 182 flow. Second operand 4 states and 90 transitions. [2025-01-10 01:10:42,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 53 transitions, 264 flow [2025-01-10 01:10:42,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 53 transitions, 259 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:10:42,587 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 171 flow [2025-01-10 01:10:42,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2025-01-10 01:10:42,589 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -1 predicate places. [2025-01-10 01:10:42,589 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 171 flow [2025-01-10 01:10:42,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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:10:42,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:42,590 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:42,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:10:42,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:42,791 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:10:42,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:42,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1664921340, now seen corresponding path program 1 times [2025-01-10 01:10:42,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:42,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246414008] [2025-01-10 01:10:42,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:42,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:42,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:10:42,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:10:42,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:42,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:42,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:10:42,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:42,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246414008] [2025-01-10 01:10:42,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246414008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:42,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:42,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:10:42,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005163883] [2025-01-10 01:10:42,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:42,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:10:42,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:42,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:10:42,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:10:42,888 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-01-10 01:10:42,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:42,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:42,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-01-10 01:10:42,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:43,041 INFO L124 PetriNetUnfolderBase]: 2128/3272 cut-off events. [2025-01-10 01:10:43,042 INFO L125 PetriNetUnfolderBase]: For 392/392 co-relation queries the response was YES. [2025-01-10 01:10:43,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6642 conditions, 3272 events. 2128/3272 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 15981 event pairs, 1813 based on Foata normal form. 0/2637 useless extension candidates. Maximal degree in co-relation 6058. Up to 2894 conditions per place. [2025-01-10 01:10:43,053 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 38 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2025-01-10 01:10:43,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 50 transitions, 247 flow [2025-01-10 01:10:43,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:10:43,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:10:43,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2025-01-10 01:10:43,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33 [2025-01-10 01:10:43,055 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 171 flow. Second operand 5 states and 99 transitions. [2025-01-10 01:10:43,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 50 transitions, 247 flow [2025-01-10 01:10:43,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 50 transitions, 243 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:10:43,058 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 167 flow [2025-01-10 01:10:43,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2025-01-10 01:10:43,059 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -2 predicate places. [2025-01-10 01:10:43,059 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 167 flow [2025-01-10 01:10:43,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:43,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:43,059 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:43,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:10:43,060 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:10:43,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:43,060 INFO L85 PathProgramCache]: Analyzing trace with hash -516784397, now seen corresponding path program 1 times [2025-01-10 01:10:43,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:43,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935348383] [2025-01-10 01:10:43,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:43,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:43,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:10:43,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:10:43,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:43,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:43,089 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:10:43,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:43,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935348383] [2025-01-10 01:10:43,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935348383] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:43,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:43,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:10:43,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925580108] [2025-01-10 01:10:43,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:43,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:10:43,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:43,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:10:43,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:10:43,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-01-10 01:10:43,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:10:43,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:43,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-01-10 01:10:43,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:43,232 INFO L124 PetriNetUnfolderBase]: 1934/2976 cut-off events. [2025-01-10 01:10:43,232 INFO L125 PetriNetUnfolderBase]: For 412/412 co-relation queries the response was YES. [2025-01-10 01:10:43,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6236 conditions, 2976 events. 1934/2976 cut-off events. For 412/412 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 14229 event pairs, 695 based on Foata normal form. 77/2496 useless extension candidates. Maximal degree in co-relation 5992. Up to 2082 conditions per place. [2025-01-10 01:10:43,240 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 54 selfloop transitions, 2 changer transitions 3/65 dead transitions. [2025-01-10 01:10:43,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 65 transitions, 323 flow [2025-01-10 01:10:43,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:10:43,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:10:43,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-01-10 01:10:43,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-01-10 01:10:43,241 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 167 flow. Second operand 3 states and 96 transitions. [2025-01-10 01:10:43,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 65 transitions, 323 flow [2025-01-10 01:10:43,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 65 transitions, 314 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:10:43,243 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 152 flow [2025-01-10 01:10:43,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2025-01-10 01:10:43,244 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -2 predicate places. [2025-01-10 01:10:43,244 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 152 flow [2025-01-10 01:10:43,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:10:43,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:43,245 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:43,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:10:43,245 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:10:43,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:43,245 INFO L85 PathProgramCache]: Analyzing trace with hash -2059190774, now seen corresponding path program 1 times [2025-01-10 01:10:43,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:43,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823956437] [2025-01-10 01:10:43,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:43,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:43,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:10:43,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:10:43,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:43,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:43,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:10:43,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:43,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823956437] [2025-01-10 01:10:43,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823956437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:43,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:43,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:10:43,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69392929] [2025-01-10 01:10:43,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:43,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:10:43,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:43,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:10:43,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:10:43,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-01-10 01:10:43,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:43,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:43,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-01-10 01:10:43,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:43,432 INFO L124 PetriNetUnfolderBase]: 1663/2557 cut-off events. [2025-01-10 01:10:43,433 INFO L125 PetriNetUnfolderBase]: For 499/499 co-relation queries the response was YES. [2025-01-10 01:10:43,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5755 conditions, 2557 events. 1663/2557 cut-off events. For 499/499 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11705 event pairs, 717 based on Foata normal form. 18/2223 useless extension candidates. Maximal degree in co-relation 5729. Up to 2249 conditions per place. [2025-01-10 01:10:43,439 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 49 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2025-01-10 01:10:43,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 58 transitions, 282 flow [2025-01-10 01:10:43,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:10:43,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:10:43,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-01-10 01:10:43,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49444444444444446 [2025-01-10 01:10:43,440 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 152 flow. Second operand 3 states and 89 transitions. [2025-01-10 01:10:43,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 58 transitions, 282 flow [2025-01-10 01:10:43,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 58 transitions, 276 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 01:10:43,442 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 169 flow [2025-01-10 01:10:43,442 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2025-01-10 01:10:43,444 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2025-01-10 01:10:43,444 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 169 flow [2025-01-10 01:10:43,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:43,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:43,444 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:43,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:10:43,444 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:10:43,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:43,445 INFO L85 PathProgramCache]: Analyzing trace with hash 103155257, now seen corresponding path program 1 times [2025-01-10 01:10:43,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:43,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552984841] [2025-01-10 01:10:43,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:43,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:43,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:10:43,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:10:43,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:43,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:43,529 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:10:43,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:43,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552984841] [2025-01-10 01:10:43,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552984841] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:43,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:43,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:10:43,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377899763] [2025-01-10 01:10:43,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:43,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:10:43,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:43,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:10:43,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:10:43,537 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-01-10 01:10:43,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:10:43,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:43,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-01-10 01:10:43,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:43,749 INFO L124 PetriNetUnfolderBase]: 1904/2946 cut-off events. [2025-01-10 01:10:43,749 INFO L125 PetriNetUnfolderBase]: For 1497/1497 co-relation queries the response was YES. [2025-01-10 01:10:43,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7190 conditions, 2946 events. 1904/2946 cut-off events. For 1497/1497 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13516 event pairs, 1453 based on Foata normal form. 64/2657 useless extension candidates. Maximal degree in co-relation 7163. Up to 2347 conditions per place. [2025-01-10 01:10:43,759 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 41 selfloop transitions, 2 changer transitions 19/68 dead transitions. [2025-01-10 01:10:43,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 68 transitions, 355 flow [2025-01-10 01:10:43,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:10:43,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:10:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-01-10 01:10:43,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.475 [2025-01-10 01:10:43,761 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 169 flow. Second operand 4 states and 114 transitions. [2025-01-10 01:10:43,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 68 transitions, 355 flow [2025-01-10 01:10:43,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 68 transitions, 330 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-01-10 01:10:43,763 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 161 flow [2025-01-10 01:10:43,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2025-01-10 01:10:43,764 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -1 predicate places. [2025-01-10 01:10:43,764 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 161 flow [2025-01-10 01:10:43,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:10:43,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:43,764 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:43,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:10:43,765 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:10:43,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:43,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1721578120, now seen corresponding path program 1 times [2025-01-10 01:10:43,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:43,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230081924] [2025-01-10 01:10:43,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:43,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:43,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:10:43,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:10:43,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:43,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:43,824 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:10:43,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:43,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230081924] [2025-01-10 01:10:43,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230081924] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:43,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:43,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:10:43,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801047591] [2025-01-10 01:10:43,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:43,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:10:43,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:43,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:10:43,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:10:43,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-01-10 01:10:43,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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:10:43,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:43,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-01-10 01:10:43,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:43,962 INFO L124 PetriNetUnfolderBase]: 1254/1954 cut-off events. [2025-01-10 01:10:43,962 INFO L125 PetriNetUnfolderBase]: For 486/486 co-relation queries the response was YES. [2025-01-10 01:10:43,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4501 conditions, 1954 events. 1254/1954 cut-off events. For 486/486 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8547 event pairs, 929 based on Foata normal form. 0/1811 useless extension candidates. Maximal degree in co-relation 4473. Up to 1766 conditions per place. [2025-01-10 01:10:43,969 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 39 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2025-01-10 01:10:43,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 47 transitions, 235 flow [2025-01-10 01:10:43,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:10:43,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:10:43,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2025-01-10 01:10:43,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35 [2025-01-10 01:10:43,970 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 161 flow. Second operand 4 states and 84 transitions. [2025-01-10 01:10:43,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 47 transitions, 235 flow [2025-01-10 01:10:43,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 47 transitions, 229 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 01:10:43,971 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 151 flow [2025-01-10 01:10:43,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=151, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2025-01-10 01:10:43,972 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2025-01-10 01:10:43,972 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 151 flow [2025-01-10 01:10:43,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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:10:43,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:43,972 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:43,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:10:43,972 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:10:43,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:43,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1721578121, now seen corresponding path program 1 times [2025-01-10 01:10:43,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:43,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826941750] [2025-01-10 01:10:43,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:43,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:43,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:10:43,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:10:43,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:43,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:44,153 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:10:44,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:44,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826941750] [2025-01-10 01:10:44,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826941750] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:44,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308607846] [2025-01-10 01:10:44,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:44,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:44,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:44,159 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:10:44,160 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:10:44,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:10:44,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:10:44,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:44,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:44,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:10:44,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:44,300 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:10:44,300 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:10:44,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308607846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:44,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:10:44,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-01-10 01:10:44,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870515663] [2025-01-10 01:10:44,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:44,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:10:44,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:44,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:10:44,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:10:44,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-01-10 01:10:44,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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:10:44,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:44,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-01-10 01:10:44,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:44,432 INFO L124 PetriNetUnfolderBase]: 900/1436 cut-off events. [2025-01-10 01:10:44,433 INFO L125 PetriNetUnfolderBase]: For 313/313 co-relation queries the response was YES. [2025-01-10 01:10:44,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3192 conditions, 1436 events. 900/1436 cut-off events. For 313/313 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6025 event pairs, 653 based on Foata normal form. 97/1457 useless extension candidates. Maximal degree in co-relation 3164. Up to 1270 conditions per place. [2025-01-10 01:10:44,436 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 37 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2025-01-10 01:10:44,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 45 transitions, 223 flow [2025-01-10 01:10:44,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:10:44,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:10:44,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2025-01-10 01:10:44,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-01-10 01:10:44,437 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 151 flow. Second operand 4 states and 90 transitions. [2025-01-10 01:10:44,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 45 transitions, 223 flow [2025-01-10 01:10:44,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 45 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:10:44,438 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 146 flow [2025-01-10 01:10:44,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2025-01-10 01:10:44,438 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2025-01-10 01:10:44,438 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 146 flow [2025-01-10 01:10:44,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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:10:44,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:44,439 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:44,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 01:10:44,643 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,SelfDestructingSolverStorable12 [2025-01-10 01:10:44,643 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:10:44,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:44,643 INFO L85 PathProgramCache]: Analyzing trace with hash -44354869, now seen corresponding path program 1 times [2025-01-10 01:10:44,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:44,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339433444] [2025-01-10 01:10:44,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:44,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:44,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:10:44,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:10:44,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:44,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:45,277 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:10:45,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:45,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339433444] [2025-01-10 01:10:45,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339433444] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:45,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:45,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:10:45,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101800591] [2025-01-10 01:10:45,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:45,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:10:45,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:45,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:10:45,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:10:45,314 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:10:45,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 146 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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:10:45,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:45,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:10:45,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:45,689 INFO L124 PetriNetUnfolderBase]: 1302/2119 cut-off events. [2025-01-10 01:10:45,689 INFO L125 PetriNetUnfolderBase]: For 456/456 co-relation queries the response was YES. [2025-01-10 01:10:45,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4695 conditions, 2119 events. 1302/2119 cut-off events. For 456/456 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 10339 event pairs, 135 based on Foata normal form. 1/2068 useless extension candidates. Maximal degree in co-relation 4667. Up to 1406 conditions per place. [2025-01-10 01:10:45,696 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 103 selfloop transitions, 25 changer transitions 3/136 dead transitions. [2025-01-10 01:10:45,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 136 transitions, 655 flow [2025-01-10 01:10:45,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:10:45,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 01:10:45,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 283 transitions. [2025-01-10 01:10:45,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39305555555555555 [2025-01-10 01:10:45,699 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 146 flow. Second operand 12 states and 283 transitions. [2025-01-10 01:10:45,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 136 transitions, 655 flow [2025-01-10 01:10:45,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 136 transitions, 652 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:10:45,701 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 279 flow [2025-01-10 01:10:45,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=279, PETRI_PLACES=69, PETRI_TRANSITIONS=67} [2025-01-10 01:10:45,702 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 10 predicate places. [2025-01-10 01:10:45,702 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 279 flow [2025-01-10 01:10:45,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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:10:45,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:45,702 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:45,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:10:45,703 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:10:45,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:45,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1396117939, now seen corresponding path program 2 times [2025-01-10 01:10:45,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:45,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504952141] [2025-01-10 01:10:45,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:45,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:45,712 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-10 01:10:45,749 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:10:45,749 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:10:45,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:46,242 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:10:46,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:46,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504952141] [2025-01-10 01:10:46,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504952141] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:46,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:46,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:10:46,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014228278] [2025-01-10 01:10:46,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:46,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:10:46,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:46,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:10:46,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:10:46,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:10:46,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 279 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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:10:46,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:46,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:10:46,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:46,690 INFO L124 PetriNetUnfolderBase]: 1472/2393 cut-off events. [2025-01-10 01:10:46,691 INFO L125 PetriNetUnfolderBase]: For 1515/1515 co-relation queries the response was YES. [2025-01-10 01:10:46,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6534 conditions, 2393 events. 1472/2393 cut-off events. For 1515/1515 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 11882 event pairs, 367 based on Foata normal form. 1/2334 useless extension candidates. Maximal degree in co-relation 6501. Up to 1741 conditions per place. [2025-01-10 01:10:46,700 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 102 selfloop transitions, 33 changer transitions 3/143 dead transitions. [2025-01-10 01:10:46,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 143 transitions, 842 flow [2025-01-10 01:10:46,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:10:46,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:10:46,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 259 transitions. [2025-01-10 01:10:46,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3924242424242424 [2025-01-10 01:10:46,702 INFO L175 Difference]: Start difference. First operand has 69 places, 67 transitions, 279 flow. Second operand 11 states and 259 transitions. [2025-01-10 01:10:46,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 143 transitions, 842 flow [2025-01-10 01:10:46,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 143 transitions, 837 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:10:46,705 INFO L231 Difference]: Finished difference. Result has 84 places, 88 transitions, 503 flow [2025-01-10 01:10:46,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=503, PETRI_PLACES=84, PETRI_TRANSITIONS=88} [2025-01-10 01:10:46,705 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 25 predicate places. [2025-01-10 01:10:46,705 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 88 transitions, 503 flow [2025-01-10 01:10:46,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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:10:46,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:46,706 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:46,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:10:46,706 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:10:46,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:46,706 INFO L85 PathProgramCache]: Analyzing trace with hash 357648921, now seen corresponding path program 3 times [2025-01-10 01:10:46,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:46,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127688433] [2025-01-10 01:10:46,706 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:10:46,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:46,713 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-01-10 01:10:46,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 33 statements. [2025-01-10 01:10:46,736 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:10:46,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:47,426 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:10:47,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:47,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127688433] [2025-01-10 01:10:47,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127688433] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:47,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:47,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:10:47,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719144642] [2025-01-10 01:10:47,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:47,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:10:47,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:47,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:10:47,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:10:47,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:10:47,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 88 transitions, 503 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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:10:47,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:47,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:10:47,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:48,080 INFO L124 PetriNetUnfolderBase]: 1645/2710 cut-off events. [2025-01-10 01:10:48,081 INFO L125 PetriNetUnfolderBase]: For 3650/3650 co-relation queries the response was YES. [2025-01-10 01:10:48,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8385 conditions, 2710 events. 1645/2710 cut-off events. For 3650/3650 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14303 event pairs, 282 based on Foata normal form. 1/2628 useless extension candidates. Maximal degree in co-relation 8344. Up to 1756 conditions per place. [2025-01-10 01:10:48,097 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 117 selfloop transitions, 43 changer transitions 3/168 dead transitions. [2025-01-10 01:10:48,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 168 transitions, 1136 flow [2025-01-10 01:10:48,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:10:48,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 01:10:48,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 287 transitions. [2025-01-10 01:10:48,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39861111111111114 [2025-01-10 01:10:48,100 INFO L175 Difference]: Start difference. First operand has 84 places, 88 transitions, 503 flow. Second operand 12 states and 287 transitions. [2025-01-10 01:10:48,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 168 transitions, 1136 flow [2025-01-10 01:10:48,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 168 transitions, 1118 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-01-10 01:10:48,113 INFO L231 Difference]: Finished difference. Result has 97 places, 97 transitions, 655 flow [2025-01-10 01:10:48,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=655, PETRI_PLACES=97, PETRI_TRANSITIONS=97} [2025-01-10 01:10:48,115 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 38 predicate places. [2025-01-10 01:10:48,115 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 97 transitions, 655 flow [2025-01-10 01:10:48,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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:10:48,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:48,116 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:48,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:10:48,116 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:10:48,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:48,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1623968965, now seen corresponding path program 4 times [2025-01-10 01:10:48,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:48,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424522701] [2025-01-10 01:10:48,118 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:10:48,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:48,129 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-01-10 01:10:48,162 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:10:48,163 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:10:48,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:48,717 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:10:48,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:48,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424522701] [2025-01-10 01:10:48,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424522701] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:48,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:48,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:10:48,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149447650] [2025-01-10 01:10:48,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:48,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:10:48,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:48,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:10:48,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:10:48,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-01-10 01:10:48,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 97 transitions, 655 flow. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 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:10:48,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:48,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-01-10 01:10:48,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:49,225 INFO L124 PetriNetUnfolderBase]: 1976/3233 cut-off events. [2025-01-10 01:10:49,225 INFO L125 PetriNetUnfolderBase]: For 6368/6368 co-relation queries the response was YES. [2025-01-10 01:10:49,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10657 conditions, 3233 events. 1976/3233 cut-off events. For 6368/6368 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 17692 event pairs, 463 based on Foata normal form. 1/3138 useless extension candidates. Maximal degree in co-relation 10612. Up to 2346 conditions per place. [2025-01-10 01:10:49,239 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 132 selfloop transitions, 41 changer transitions 3/180 dead transitions. [2025-01-10 01:10:49,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 180 transitions, 1348 flow [2025-01-10 01:10:49,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:10:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 01:10:49,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 281 transitions. [2025-01-10 01:10:49,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3902777777777778 [2025-01-10 01:10:49,242 INFO L175 Difference]: Start difference. First operand has 97 places, 97 transitions, 655 flow. Second operand 12 states and 281 transitions. [2025-01-10 01:10:49,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 180 transitions, 1348 flow [2025-01-10 01:10:49,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 180 transitions, 1274 flow, removed 16 selfloop flow, removed 6 redundant places. [2025-01-10 01:10:49,253 INFO L231 Difference]: Finished difference. Result has 106 places, 105 transitions, 759 flow [2025-01-10 01:10:49,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=759, PETRI_PLACES=106, PETRI_TRANSITIONS=105} [2025-01-10 01:10:49,253 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 47 predicate places. [2025-01-10 01:10:49,253 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 105 transitions, 759 flow [2025-01-10 01:10:49,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 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:10:49,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:49,253 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:49,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:10:49,253 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:10:49,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:49,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1964922435, now seen corresponding path program 5 times [2025-01-10 01:10:49,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:49,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623714886] [2025-01-10 01:10:49,255 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:10:49,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:49,262 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 3 equivalence classes. [2025-01-10 01:10:49,282 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:10:49,282 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:10:49,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:49,721 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:10:49,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:49,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623714886] [2025-01-10 01:10:49,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623714886] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:49,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:49,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:10:49,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179394735] [2025-01-10 01:10:49,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:49,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:10:49,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:49,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:10:49,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:10:49,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:10:49,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 105 transitions, 759 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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:10:49,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:49,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:10:49,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:50,237 INFO L124 PetriNetUnfolderBase]: 1778/2959 cut-off events. [2025-01-10 01:10:50,241 INFO L125 PetriNetUnfolderBase]: For 7983/7983 co-relation queries the response was YES. [2025-01-10 01:10:50,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10376 conditions, 2959 events. 1778/2959 cut-off events. For 7983/7983 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 16209 event pairs, 401 based on Foata normal form. 1/2870 useless extension candidates. Maximal degree in co-relation 10326. Up to 2219 conditions per place. [2025-01-10 01:10:50,267 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 122 selfloop transitions, 38 changer transitions 3/168 dead transitions. [2025-01-10 01:10:50,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 168 transitions, 1355 flow [2025-01-10 01:10:50,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:10:50,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 01:10:50,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 274 transitions. [2025-01-10 01:10:50,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38055555555555554 [2025-01-10 01:10:50,275 INFO L175 Difference]: Start difference. First operand has 106 places, 105 transitions, 759 flow. Second operand 12 states and 274 transitions. [2025-01-10 01:10:50,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 168 transitions, 1355 flow [2025-01-10 01:10:50,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 168 transitions, 1265 flow, removed 24 selfloop flow, removed 6 redundant places. [2025-01-10 01:10:50,294 INFO L231 Difference]: Finished difference. Result has 113 places, 108 transitions, 790 flow [2025-01-10 01:10:50,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=790, PETRI_PLACES=113, PETRI_TRANSITIONS=108} [2025-01-10 01:10:50,298 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 54 predicate places. [2025-01-10 01:10:50,298 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 108 transitions, 790 flow [2025-01-10 01:10:50,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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:10:50,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:50,298 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:50,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 01:10:50,298 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:10:50,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:50,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1296170811, now seen corresponding path program 6 times [2025-01-10 01:10:50,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:50,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649130671] [2025-01-10 01:10:50,299 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:10:50,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:50,305 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 3 equivalence classes. [2025-01-10 01:10:50,319 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:10:50,319 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-10 01:10:50,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:50,710 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:10:50,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:50,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649130671] [2025-01-10 01:10:50,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649130671] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:50,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:50,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:10:50,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903797633] [2025-01-10 01:10:50,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:50,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:10:50,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:50,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:10:50,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:10:50,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:10:50,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 108 transitions, 790 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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:10:50,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:50,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:10:50,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:51,311 INFO L124 PetriNetUnfolderBase]: 1900/3175 cut-off events. [2025-01-10 01:10:51,312 INFO L125 PetriNetUnfolderBase]: For 8713/8713 co-relation queries the response was YES. [2025-01-10 01:10:51,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11206 conditions, 3175 events. 1900/3175 cut-off events. For 8713/8713 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 17733 event pairs, 603 based on Foata normal form. 1/3082 useless extension candidates. Maximal degree in co-relation 11152. Up to 2486 conditions per place. [2025-01-10 01:10:51,329 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 129 selfloop transitions, 36 changer transitions 3/173 dead transitions. [2025-01-10 01:10:51,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 173 transitions, 1481 flow [2025-01-10 01:10:51,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:10:51,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:10:51,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 258 transitions. [2025-01-10 01:10:51,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39090909090909093 [2025-01-10 01:10:51,331 INFO L175 Difference]: Start difference. First operand has 113 places, 108 transitions, 790 flow. Second operand 11 states and 258 transitions. [2025-01-10 01:10:51,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 173 transitions, 1481 flow [2025-01-10 01:10:51,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 173 transitions, 1393 flow, removed 7 selfloop flow, removed 9 redundant places. [2025-01-10 01:10:51,349 INFO L231 Difference]: Finished difference. Result has 119 places, 119 transitions, 935 flow [2025-01-10 01:10:51,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=935, PETRI_PLACES=119, PETRI_TRANSITIONS=119} [2025-01-10 01:10:51,350 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 60 predicate places. [2025-01-10 01:10:51,351 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 119 transitions, 935 flow [2025-01-10 01:10:51,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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:10:51,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:51,351 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:51,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:10:51,352 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:10:51,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:51,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1207042441, now seen corresponding path program 7 times [2025-01-10 01:10:51,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:51,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681995673] [2025-01-10 01:10:51,353 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:10:51,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:51,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:10:51,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:10:51,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:51,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:51,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:10:51,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:51,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681995673] [2025-01-10 01:10:51,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681995673] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:51,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:51,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:10:51,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376823144] [2025-01-10 01:10:51,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:51,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:10:51,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:51,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:10:51,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:10:51,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:10:51,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 119 transitions, 935 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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:10:51,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:51,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:10:51,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:52,331 INFO L124 PetriNetUnfolderBase]: 2026/3407 cut-off events. [2025-01-10 01:10:52,331 INFO L125 PetriNetUnfolderBase]: For 13466/13466 co-relation queries the response was YES. [2025-01-10 01:10:52,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12639 conditions, 3407 events. 2026/3407 cut-off events. For 13466/13466 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 19442 event pairs, 600 based on Foata normal form. 1/3308 useless extension candidates. Maximal degree in co-relation 12580. Up to 2677 conditions per place. [2025-01-10 01:10:52,348 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 138 selfloop transitions, 36 changer transitions 3/182 dead transitions. [2025-01-10 01:10:52,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 182 transitions, 1662 flow [2025-01-10 01:10:52,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:10:52,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:10:52,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 255 transitions. [2025-01-10 01:10:52,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2025-01-10 01:10:52,350 INFO L175 Difference]: Start difference. First operand has 119 places, 119 transitions, 935 flow. Second operand 11 states and 255 transitions. [2025-01-10 01:10:52,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 182 transitions, 1662 flow [2025-01-10 01:10:52,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 182 transitions, 1575 flow, removed 36 selfloop flow, removed 2 redundant places. [2025-01-10 01:10:52,424 INFO L231 Difference]: Finished difference. Result has 131 places, 128 transitions, 1081 flow [2025-01-10 01:10:52,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1081, PETRI_PLACES=131, PETRI_TRANSITIONS=128} [2025-01-10 01:10:52,425 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 72 predicate places. [2025-01-10 01:10:52,425 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 128 transitions, 1081 flow [2025-01-10 01:10:52,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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:10:52,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:52,425 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:52,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 01:10:52,425 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:10:52,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:52,425 INFO L85 PathProgramCache]: Analyzing trace with hash 753377693, now seen corresponding path program 8 times [2025-01-10 01:10:52,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:52,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455519607] [2025-01-10 01:10:52,426 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:52,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:52,432 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-10 01:10:52,454 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:10:52,456 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:10:52,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:52,849 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:10:52,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:52,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455519607] [2025-01-10 01:10:52,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455519607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:52,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:52,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:10:52,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138036747] [2025-01-10 01:10:52,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:52,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:10:52,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:52,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:10:52,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:10:52,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:10:52,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 128 transitions, 1081 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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:10:52,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:52,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:10:52,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:53,302 INFO L124 PetriNetUnfolderBase]: 2158/3634 cut-off events. [2025-01-10 01:10:53,302 INFO L125 PetriNetUnfolderBase]: For 21357/21357 co-relation queries the response was YES. [2025-01-10 01:10:53,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14406 conditions, 3634 events. 2158/3634 cut-off events. For 21357/21357 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 21200 event pairs, 673 based on Foata normal form. 1/3539 useless extension candidates. Maximal degree in co-relation 14342. Up to 2881 conditions per place. [2025-01-10 01:10:53,331 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 149 selfloop transitions, 36 changer transitions 3/193 dead transitions. [2025-01-10 01:10:53,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 193 transitions, 1866 flow [2025-01-10 01:10:53,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:10:53,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:10:53,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 257 transitions. [2025-01-10 01:10:53,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3893939393939394 [2025-01-10 01:10:53,333 INFO L175 Difference]: Start difference. First operand has 131 places, 128 transitions, 1081 flow. Second operand 11 states and 257 transitions. [2025-01-10 01:10:53,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 193 transitions, 1866 flow [2025-01-10 01:10:53,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 193 transitions, 1738 flow, removed 47 selfloop flow, removed 5 redundant places. [2025-01-10 01:10:53,374 INFO L231 Difference]: Finished difference. Result has 139 places, 137 transitions, 1171 flow [2025-01-10 01:10:53,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=953, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1171, PETRI_PLACES=139, PETRI_TRANSITIONS=137} [2025-01-10 01:10:53,374 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 80 predicate places. [2025-01-10 01:10:53,374 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 137 transitions, 1171 flow [2025-01-10 01:10:53,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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:10:53,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:53,375 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:53,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 01:10:53,375 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:10:53,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:53,376 INFO L85 PathProgramCache]: Analyzing trace with hash -372544781, now seen corresponding path program 9 times [2025-01-10 01:10:53,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:53,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060563892] [2025-01-10 01:10:53,376 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:10:53,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:53,388 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-01-10 01:10:53,406 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 33 statements. [2025-01-10 01:10:53,407 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:10:53,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:53,813 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:10:53,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:53,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060563892] [2025-01-10 01:10:53,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060563892] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:53,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:53,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:10:53,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190911654] [2025-01-10 01:10:53,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:53,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:10:53,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:53,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:10:53,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:10:53,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:10:53,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 137 transitions, 1171 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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:10:53,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:53,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:10:53,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:54,414 INFO L124 PetriNetUnfolderBase]: 2345/3932 cut-off events. [2025-01-10 01:10:54,414 INFO L125 PetriNetUnfolderBase]: For 28383/28401 co-relation queries the response was YES. [2025-01-10 01:10:54,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16330 conditions, 3932 events. 2345/3932 cut-off events. For 28383/28401 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 23472 event pairs, 721 based on Foata normal form. 1/3834 useless extension candidates. Maximal degree in co-relation 16262. Up to 3093 conditions per place. [2025-01-10 01:10:54,439 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 163 selfloop transitions, 39 changer transitions 3/210 dead transitions. [2025-01-10 01:10:54,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 210 transitions, 2063 flow [2025-01-10 01:10:54,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:10:54,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:10:54,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 268 transitions. [2025-01-10 01:10:54,441 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2025-01-10 01:10:54,441 INFO L175 Difference]: Start difference. First operand has 139 places, 137 transitions, 1171 flow. Second operand 11 states and 268 transitions. [2025-01-10 01:10:54,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 210 transitions, 2063 flow [2025-01-10 01:10:54,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 210 transitions, 1929 flow, removed 50 selfloop flow, removed 5 redundant places. [2025-01-10 01:10:54,480 INFO L231 Difference]: Finished difference. Result has 148 places, 146 transitions, 1306 flow [2025-01-10 01:10:54,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1306, PETRI_PLACES=148, PETRI_TRANSITIONS=146} [2025-01-10 01:10:54,481 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 89 predicate places. [2025-01-10 01:10:54,482 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 146 transitions, 1306 flow [2025-01-10 01:10:54,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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:10:54,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:54,482 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:54,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 01:10:54,482 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:10:54,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:54,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1681736775, now seen corresponding path program 10 times [2025-01-10 01:10:54,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:54,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605129155] [2025-01-10 01:10:54,483 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:10:54,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:54,488 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-01-10 01:10:54,506 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:10:54,508 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:10:54,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:10:55,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:55,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605129155] [2025-01-10 01:10:55,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605129155] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:55,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:55,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:10:55,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39473718] [2025-01-10 01:10:55,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:55,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:10:55,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:55,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:10:55,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:10:55,113 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-01-10 01:10:55,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 146 transitions, 1306 flow. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 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:10:55,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:55,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-01-10 01:10:55,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:55,665 INFO L124 PetriNetUnfolderBase]: 2715/4490 cut-off events. [2025-01-10 01:10:55,665 INFO L125 PetriNetUnfolderBase]: For 37287/37305 co-relation queries the response was YES. [2025-01-10 01:10:55,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19068 conditions, 4490 events. 2715/4490 cut-off events. For 37287/37305 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 27206 event pairs, 916 based on Foata normal form. 13/4398 useless extension candidates. Maximal degree in co-relation 18995. Up to 3622 conditions per place. [2025-01-10 01:10:55,695 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 172 selfloop transitions, 39 changer transitions 3/218 dead transitions. [2025-01-10 01:10:55,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 218 transitions, 2238 flow [2025-01-10 01:10:55,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:10:55,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:10:55,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 257 transitions. [2025-01-10 01:10:55,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3893939393939394 [2025-01-10 01:10:55,697 INFO L175 Difference]: Start difference. First operand has 148 places, 146 transitions, 1306 flow. Second operand 11 states and 257 transitions. [2025-01-10 01:10:55,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 218 transitions, 2238 flow [2025-01-10 01:10:55,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 218 transitions, 2098 flow, removed 52 selfloop flow, removed 5 redundant places. [2025-01-10 01:10:55,757 INFO L231 Difference]: Finished difference. Result has 157 places, 155 transitions, 1457 flow [2025-01-10 01:10:55,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1166, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1457, PETRI_PLACES=157, PETRI_TRANSITIONS=155} [2025-01-10 01:10:55,758 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 98 predicate places. [2025-01-10 01:10:55,758 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 155 transitions, 1457 flow [2025-01-10 01:10:55,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 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:10:55,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:55,758 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:55,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 01:10:55,759 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:10:55,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:55,759 INFO L85 PathProgramCache]: Analyzing trace with hash 260232925, now seen corresponding path program 11 times [2025-01-10 01:10:55,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:55,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650651333] [2025-01-10 01:10:55,759 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:10:55,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:55,768 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 3 equivalence classes. [2025-01-10 01:10:55,781 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:10:55,782 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:10:55,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:56,096 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:10:56,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:56,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650651333] [2025-01-10 01:10:56,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650651333] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:56,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:56,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:10:56,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216913435] [2025-01-10 01:10:56,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:56,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:10:56,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:56,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:10:56,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:10:56,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:10:56,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 155 transitions, 1457 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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:10:56,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:56,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:10:56,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:56,634 INFO L124 PetriNetUnfolderBase]: 2517/4202 cut-off events. [2025-01-10 01:10:56,635 INFO L125 PetriNetUnfolderBase]: For 39118/39148 co-relation queries the response was YES. [2025-01-10 01:10:56,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18302 conditions, 4202 events. 2517/4202 cut-off events. For 39118/39148 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 25430 event pairs, 874 based on Foata normal form. 3/4113 useless extension candidates. Maximal degree in co-relation 18223. Up to 3475 conditions per place. [2025-01-10 01:10:56,668 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 165 selfloop transitions, 37 changer transitions 4/211 dead transitions. [2025-01-10 01:10:56,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 211 transitions, 2194 flow [2025-01-10 01:10:56,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:10:56,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:10:56,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 254 transitions. [2025-01-10 01:10:56,670 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38484848484848483 [2025-01-10 01:10:56,670 INFO L175 Difference]: Start difference. First operand has 157 places, 155 transitions, 1457 flow. Second operand 11 states and 254 transitions. [2025-01-10 01:10:56,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 211 transitions, 2194 flow [2025-01-10 01:10:56,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 211 transitions, 2038 flow, removed 60 selfloop flow, removed 5 redundant places. [2025-01-10 01:10:56,727 INFO L231 Difference]: Finished difference. Result has 164 places, 159 transitions, 1426 flow [2025-01-10 01:10:56,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1301, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1426, PETRI_PLACES=164, PETRI_TRANSITIONS=159} [2025-01-10 01:10:56,728 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 105 predicate places. [2025-01-10 01:10:56,728 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 159 transitions, 1426 flow [2025-01-10 01:10:56,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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:10:56,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:56,729 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:56,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 01:10:56,730 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:10:56,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:56,730 INFO L85 PathProgramCache]: Analyzing trace with hash -36534527, now seen corresponding path program 12 times [2025-01-10 01:10:56,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:56,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372028008] [2025-01-10 01:10:56,731 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:10:56,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:56,737 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 3 equivalence classes. [2025-01-10 01:10:56,747 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:10:56,747 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-10 01:10:56,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:57,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:10:57,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:57,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372028008] [2025-01-10 01:10:57,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372028008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:57,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:57,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:10:57,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72257972] [2025-01-10 01:10:57,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:57,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:10:57,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:57,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:10:57,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:10:57,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:10:57,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 159 transitions, 1426 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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:10:57,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:57,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:10:57,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:57,667 INFO L124 PetriNetUnfolderBase]: 2578/4320 cut-off events. [2025-01-10 01:10:57,667 INFO L125 PetriNetUnfolderBase]: For 35623/35647 co-relation queries the response was YES. [2025-01-10 01:10:57,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18252 conditions, 4320 events. 2578/4320 cut-off events. For 35623/35647 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 26528 event pairs, 839 based on Foata normal form. 19/4240 useless extension candidates. Maximal degree in co-relation 18169. Up to 3389 conditions per place. [2025-01-10 01:10:57,702 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 173 selfloop transitions, 41 changer transitions 4/223 dead transitions. [2025-01-10 01:10:57,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 223 transitions, 2216 flow [2025-01-10 01:10:57,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:10:57,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:10:57,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 266 transitions. [2025-01-10 01:10:57,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.403030303030303 [2025-01-10 01:10:57,703 INFO L175 Difference]: Start difference. First operand has 164 places, 159 transitions, 1426 flow. Second operand 11 states and 266 transitions. [2025-01-10 01:10:57,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 223 transitions, 2216 flow [2025-01-10 01:10:57,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 223 transitions, 2112 flow, removed 17 selfloop flow, removed 8 redundant places. [2025-01-10 01:10:57,786 INFO L231 Difference]: Finished difference. Result has 168 places, 163 transitions, 1455 flow [2025-01-10 01:10:57,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1322, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1455, PETRI_PLACES=168, PETRI_TRANSITIONS=163} [2025-01-10 01:10:57,786 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 109 predicate places. [2025-01-10 01:10:57,786 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 163 transitions, 1455 flow [2025-01-10 01:10:57,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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:10:57,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:57,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:57,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 01:10:57,787 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:10:57,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:57,788 INFO L85 PathProgramCache]: Analyzing trace with hash 897923909, now seen corresponding path program 13 times [2025-01-10 01:10:57,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:57,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285962663] [2025-01-10 01:10:57,788 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:10:57,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:57,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:10:57,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:10:57,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:57,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:58,317 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:10:58,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:58,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285962663] [2025-01-10 01:10:58,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285962663] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:58,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:58,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:10:58,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543001931] [2025-01-10 01:10:58,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:58,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:10:58,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:58,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:10:58,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:10:58,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:10:58,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 163 transitions, 1455 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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:10:58,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:58,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:10:58,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:58,981 INFO L124 PetriNetUnfolderBase]: 2614/4395 cut-off events. [2025-01-10 01:10:58,981 INFO L125 PetriNetUnfolderBase]: For 35677/35685 co-relation queries the response was YES. [2025-01-10 01:10:59,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18474 conditions, 4395 events. 2614/4395 cut-off events. For 35677/35685 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 27229 event pairs, 951 based on Foata normal form. 9/4302 useless extension candidates. Maximal degree in co-relation 18389. Up to 3724 conditions per place. [2025-01-10 01:10:59,014 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 169 selfloop transitions, 35 changer transitions 3/212 dead transitions. [2025-01-10 01:10:59,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 212 transitions, 2149 flow [2025-01-10 01:10:59,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:10:59,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:10:59,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 244 transitions. [2025-01-10 01:10:59,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3696969696969697 [2025-01-10 01:10:59,022 INFO L175 Difference]: Start difference. First operand has 168 places, 163 transitions, 1455 flow. Second operand 11 states and 244 transitions. [2025-01-10 01:10:59,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 212 transitions, 2149 flow [2025-01-10 01:10:59,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 212 transitions, 2036 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-01-10 01:10:59,102 INFO L231 Difference]: Finished difference. Result has 174 places, 168 transitions, 1485 flow [2025-01-10 01:10:59,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1346, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1485, PETRI_PLACES=174, PETRI_TRANSITIONS=168} [2025-01-10 01:10:59,102 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 115 predicate places. [2025-01-10 01:10:59,103 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 168 transitions, 1485 flow [2025-01-10 01:10:59,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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:10:59,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:59,103 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:59,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 01:10:59,103 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:10:59,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:59,103 INFO L85 PathProgramCache]: Analyzing trace with hash 890593213, now seen corresponding path program 14 times [2025-01-10 01:10:59,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:59,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303157753] [2025-01-10 01:10:59,104 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:59,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:59,108 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-10 01:10:59,118 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:10:59,118 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:10:59,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:59,393 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:10:59,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:59,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303157753] [2025-01-10 01:10:59,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303157753] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:59,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:59,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:10:59,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887257880] [2025-01-10 01:10:59,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:59,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:10:59,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:59,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:10:59,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:10:59,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:10:59,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 168 transitions, 1485 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 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:10:59,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:59,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:10:59,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:59,960 INFO L124 PetriNetUnfolderBase]: 2614/4393 cut-off events. [2025-01-10 01:10:59,960 INFO L125 PetriNetUnfolderBase]: For 35117/35125 co-relation queries the response was YES. [2025-01-10 01:10:59,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18368 conditions, 4393 events. 2614/4393 cut-off events. For 35117/35125 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 27236 event pairs, 941 based on Foata normal form. 9/4300 useless extension candidates. Maximal degree in co-relation 18279. Up to 3692 conditions per place. [2025-01-10 01:10:59,995 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 172 selfloop transitions, 36 changer transitions 4/217 dead transitions. [2025-01-10 01:10:59,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 217 transitions, 2160 flow [2025-01-10 01:10:59,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:10:59,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:10:59,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 247 transitions. [2025-01-10 01:10:59,996 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37424242424242427 [2025-01-10 01:10:59,996 INFO L175 Difference]: Start difference. First operand has 174 places, 168 transitions, 1485 flow. Second operand 11 states and 247 transitions. [2025-01-10 01:10:59,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 217 transitions, 2160 flow [2025-01-10 01:11:00,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 217 transitions, 2062 flow, removed 17 selfloop flow, removed 7 redundant places. [2025-01-10 01:11:00,070 INFO L231 Difference]: Finished difference. Result has 179 places, 171 transitions, 1492 flow [2025-01-10 01:11:00,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1387, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1492, PETRI_PLACES=179, PETRI_TRANSITIONS=171} [2025-01-10 01:11:00,071 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 120 predicate places. [2025-01-10 01:11:00,071 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 171 transitions, 1492 flow [2025-01-10 01:11:00,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:00,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:00,071 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:00,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-10 01:11:00,071 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:11:00,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:00,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1827648001, now seen corresponding path program 15 times [2025-01-10 01:11:00,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:00,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984277126] [2025-01-10 01:11:00,072 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:11:00,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:00,077 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-01-10 01:11:00,093 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 33 statements. [2025-01-10 01:11:00,093 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:11:00,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:00,382 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:00,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:00,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984277126] [2025-01-10 01:11:00,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984277126] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:00,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:00,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:11:00,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636501214] [2025-01-10 01:11:00,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:00,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:00,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:00,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:00,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:00,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:11:00,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 171 transitions, 1492 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:00,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:00,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:11:00,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:01,129 INFO L124 PetriNetUnfolderBase]: 2635/4431 cut-off events. [2025-01-10 01:11:01,129 INFO L125 PetriNetUnfolderBase]: For 35366/35374 co-relation queries the response was YES. [2025-01-10 01:11:01,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18573 conditions, 4431 events. 2635/4431 cut-off events. For 35366/35374 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 27532 event pairs, 926 based on Foata normal form. 9/4335 useless extension candidates. Maximal degree in co-relation 18482. Up to 3571 conditions per place. [2025-01-10 01:11:01,162 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 178 selfloop transitions, 43 changer transitions 4/230 dead transitions. [2025-01-10 01:11:01,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 230 transitions, 2271 flow [2025-01-10 01:11:01,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:11:01,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:11:01,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 259 transitions. [2025-01-10 01:11:01,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3924242424242424 [2025-01-10 01:11:01,163 INFO L175 Difference]: Start difference. First operand has 179 places, 171 transitions, 1492 flow. Second operand 11 states and 259 transitions. [2025-01-10 01:11:01,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 230 transitions, 2271 flow [2025-01-10 01:11:01,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 230 transitions, 2204 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-10 01:11:01,234 INFO L231 Difference]: Finished difference. Result has 184 places, 176 transitions, 1613 flow [2025-01-10 01:11:01,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1425, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1613, PETRI_PLACES=184, PETRI_TRANSITIONS=176} [2025-01-10 01:11:01,235 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 125 predicate places. [2025-01-10 01:11:01,235 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 176 transitions, 1613 flow [2025-01-10 01:11:01,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:01,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:01,235 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:01,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-10 01:11:01,235 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:11:01,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:01,236 INFO L85 PathProgramCache]: Analyzing trace with hash -629987245, now seen corresponding path program 16 times [2025-01-10 01:11:01,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:01,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973211946] [2025-01-10 01:11:01,236 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:11:01,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:01,247 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-01-10 01:11:01,257 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:11:01,257 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:11:01,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:01,642 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:01,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:01,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973211946] [2025-01-10 01:11:01,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973211946] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:01,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:01,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:11:01,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534209388] [2025-01-10 01:11:01,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:01,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:01,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:01,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:01,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:01,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-01-10 01:11:01,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 176 transitions, 1613 flow. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:01,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:01,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-01-10 01:11:01,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:02,279 INFO L124 PetriNetUnfolderBase]: 3076/5122 cut-off events. [2025-01-10 01:11:02,279 INFO L125 PetriNetUnfolderBase]: For 54263/54295 co-relation queries the response was YES. [2025-01-10 01:11:02,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22953 conditions, 5122 events. 3076/5122 cut-off events. For 54263/54295 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 32623 event pairs, 1020 based on Foata normal form. 1/5003 useless extension candidates. Maximal degree in co-relation 22859. Up to 4035 conditions per place. [2025-01-10 01:11:02,315 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 206 selfloop transitions, 44 changer transitions 3/257 dead transitions. [2025-01-10 01:11:02,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 257 transitions, 2782 flow [2025-01-10 01:11:02,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:11:02,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 01:11:02,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 275 transitions. [2025-01-10 01:11:02,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3819444444444444 [2025-01-10 01:11:02,321 INFO L175 Difference]: Start difference. First operand has 184 places, 176 transitions, 1613 flow. Second operand 12 states and 275 transitions. [2025-01-10 01:11:02,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 257 transitions, 2782 flow [2025-01-10 01:11:02,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 257 transitions, 2669 flow, removed 20 selfloop flow, removed 7 redundant places. [2025-01-10 01:11:02,430 INFO L231 Difference]: Finished difference. Result has 192 places, 188 transitions, 1875 flow [2025-01-10 01:11:02,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1500, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1875, PETRI_PLACES=192, PETRI_TRANSITIONS=188} [2025-01-10 01:11:02,431 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 133 predicate places. [2025-01-10 01:11:02,431 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 188 transitions, 1875 flow [2025-01-10 01:11:02,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:02,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:02,431 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:02,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-10 01:11:02,431 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:11:02,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:02,432 INFO L85 PathProgramCache]: Analyzing trace with hash -84790259, now seen corresponding path program 17 times [2025-01-10 01:11:02,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:02,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199623721] [2025-01-10 01:11:02,432 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:11:02,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:02,437 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 3 equivalence classes. [2025-01-10 01:11:02,452 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:11:02,452 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:11:02,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:02,828 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:02,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:02,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199623721] [2025-01-10 01:11:02,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199623721] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:02,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:02,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:11:02,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064910229] [2025-01-10 01:11:02,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:02,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:02,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:02,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:02,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:02,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:11:02,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 188 transitions, 1875 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:02,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:02,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:11:02,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:03,855 INFO L124 PetriNetUnfolderBase]: 3075/5183 cut-off events. [2025-01-10 01:11:03,855 INFO L125 PetriNetUnfolderBase]: For 66738/66738 co-relation queries the response was YES. [2025-01-10 01:11:03,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24577 conditions, 5183 events. 3075/5183 cut-off events. For 66738/66738 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 33496 event pairs, 1012 based on Foata normal form. 1/5072 useless extension candidates. Maximal degree in co-relation 24478. Up to 3978 conditions per place. [2025-01-10 01:11:03,895 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 202 selfloop transitions, 54 changer transitions 3/264 dead transitions. [2025-01-10 01:11:03,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 264 transitions, 3096 flow [2025-01-10 01:11:03,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:11:03,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 01:11:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 284 transitions. [2025-01-10 01:11:03,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39444444444444443 [2025-01-10 01:11:03,896 INFO L175 Difference]: Start difference. First operand has 192 places, 188 transitions, 1875 flow. Second operand 12 states and 284 transitions. [2025-01-10 01:11:03,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 264 transitions, 3096 flow [2025-01-10 01:11:04,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 264 transitions, 2824 flow, removed 119 selfloop flow, removed 5 redundant places. [2025-01-10 01:11:04,017 INFO L231 Difference]: Finished difference. Result has 202 places, 199 transitions, 2030 flow [2025-01-10 01:11:04,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1635, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2030, PETRI_PLACES=202, PETRI_TRANSITIONS=199} [2025-01-10 01:11:04,018 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 143 predicate places. [2025-01-10 01:11:04,018 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 199 transitions, 2030 flow [2025-01-10 01:11:04,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:04,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:04,018 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:04,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-10 01:11:04,021 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:11:04,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:04,022 INFO L85 PathProgramCache]: Analyzing trace with hash -2121328095, now seen corresponding path program 18 times [2025-01-10 01:11:04,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:04,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11093651] [2025-01-10 01:11:04,022 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:11:04,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:04,029 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 3 equivalence classes. [2025-01-10 01:11:04,049 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:11:04,050 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-10 01:11:04,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:04,452 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:04,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:04,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11093651] [2025-01-10 01:11:04,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11093651] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:04,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:04,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:11:04,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434410467] [2025-01-10 01:11:04,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:04,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:04,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:04,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:04,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:04,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:11:04,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 199 transitions, 2030 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:04,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:04,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:11:04,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:05,304 INFO L124 PetriNetUnfolderBase]: 3171/5355 cut-off events. [2025-01-10 01:11:05,305 INFO L125 PetriNetUnfolderBase]: For 77510/77510 co-relation queries the response was YES. [2025-01-10 01:11:05,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25896 conditions, 5355 events. 3171/5355 cut-off events. For 77510/77510 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 35238 event pairs, 1100 based on Foata normal form. 1/5240 useless extension candidates. Maximal degree in co-relation 25792. Up to 4250 conditions per place. [2025-01-10 01:11:05,353 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 211 selfloop transitions, 49 changer transitions 3/268 dead transitions. [2025-01-10 01:11:05,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 268 transitions, 3126 flow [2025-01-10 01:11:05,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:11:05,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 01:11:05,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 281 transitions. [2025-01-10 01:11:05,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3902777777777778 [2025-01-10 01:11:05,355 INFO L175 Difference]: Start difference. First operand has 202 places, 199 transitions, 2030 flow. Second operand 12 states and 281 transitions. [2025-01-10 01:11:05,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 268 transitions, 3126 flow [2025-01-10 01:11:05,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 268 transitions, 2911 flow, removed 83 selfloop flow, removed 7 redundant places. [2025-01-10 01:11:05,483 INFO L231 Difference]: Finished difference. Result has 209 places, 205 transitions, 2087 flow [2025-01-10 01:11:05,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1815, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2087, PETRI_PLACES=209, PETRI_TRANSITIONS=205} [2025-01-10 01:11:05,484 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 150 predicate places. [2025-01-10 01:11:05,484 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 205 transitions, 2087 flow [2025-01-10 01:11:05,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:05,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:05,484 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:05,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-10 01:11:05,484 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:11:05,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:05,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1405710947, now seen corresponding path program 19 times [2025-01-10 01:11:05,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:05,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396030906] [2025-01-10 01:11:05,485 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:11:05,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:05,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:11:05,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:11:05,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:05,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:05,789 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:05,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:05,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396030906] [2025-01-10 01:11:05,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396030906] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:05,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:05,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:11:05,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062773112] [2025-01-10 01:11:05,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:05,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:05,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:05,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:05,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:05,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:11:05,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 205 transitions, 2087 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:05,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:05,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:11:05,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:06,620 INFO L124 PetriNetUnfolderBase]: 3171/5369 cut-off events. [2025-01-10 01:11:06,620 INFO L125 PetriNetUnfolderBase]: For 77520/77520 co-relation queries the response was YES. [2025-01-10 01:11:06,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25780 conditions, 5369 events. 3171/5369 cut-off events. For 77520/77520 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 35451 event pairs, 1109 based on Foata normal form. 1/5251 useless extension candidates. Maximal degree in co-relation 25673. Up to 4327 conditions per place. [2025-01-10 01:11:06,660 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 208 selfloop transitions, 51 changer transitions 4/268 dead transitions. [2025-01-10 01:11:06,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 268 transitions, 3053 flow [2025-01-10 01:11:06,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:11:06,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 01:11:06,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 278 transitions. [2025-01-10 01:11:06,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3861111111111111 [2025-01-10 01:11:06,661 INFO L175 Difference]: Start difference. First operand has 209 places, 205 transitions, 2087 flow. Second operand 12 states and 278 transitions. [2025-01-10 01:11:06,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 268 transitions, 3053 flow [2025-01-10 01:11:06,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 268 transitions, 2888 flow, removed 57 selfloop flow, removed 8 redundant places. [2025-01-10 01:11:06,812 INFO L231 Difference]: Finished difference. Result has 214 places, 209 transitions, 2102 flow [2025-01-10 01:11:06,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1922, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2102, PETRI_PLACES=214, PETRI_TRANSITIONS=209} [2025-01-10 01:11:06,812 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 155 predicate places. [2025-01-10 01:11:06,812 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 209 transitions, 2102 flow [2025-01-10 01:11:06,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:06,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:06,813 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:06,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-10 01:11:06,813 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:11:06,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:06,813 INFO L85 PathProgramCache]: Analyzing trace with hash 118216143, now seen corresponding path program 20 times [2025-01-10 01:11:06,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:06,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678124146] [2025-01-10 01:11:06,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:11:06,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:06,822 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-10 01:11:06,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:11:06,832 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:11:06,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:07,218 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:07,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:07,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678124146] [2025-01-10 01:11:07,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678124146] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:07,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:07,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:11:07,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818405199] [2025-01-10 01:11:07,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:07,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:07,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:07,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:07,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:07,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:11:07,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 209 transitions, 2102 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:07,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:07,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:11:07,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:08,069 INFO L124 PetriNetUnfolderBase]: 3398/5736 cut-off events. [2025-01-10 01:11:08,069 INFO L125 PetriNetUnfolderBase]: For 89546/89546 co-relation queries the response was YES. [2025-01-10 01:11:08,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28645 conditions, 5736 events. 3398/5736 cut-off events. For 89546/89546 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 38289 event pairs, 1341 based on Foata normal form. 1/5597 useless extension candidates. Maximal degree in co-relation 28536. Up to 4776 conditions per place. [2025-01-10 01:11:08,116 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 238 selfloop transitions, 39 changer transitions 3/285 dead transitions. [2025-01-10 01:11:08,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 285 transitions, 3447 flow [2025-01-10 01:11:08,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:11:08,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:11:08,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 271 transitions. [2025-01-10 01:11:08,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4106060606060606 [2025-01-10 01:11:08,117 INFO L175 Difference]: Start difference. First operand has 214 places, 209 transitions, 2102 flow. Second operand 11 states and 271 transitions. [2025-01-10 01:11:08,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 285 transitions, 3447 flow [2025-01-10 01:11:08,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 285 transitions, 3289 flow, removed 29 selfloop flow, removed 9 redundant places. [2025-01-10 01:11:08,279 INFO L231 Difference]: Finished difference. Result has 220 places, 221 transitions, 2378 flow [2025-01-10 01:11:08,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1954, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2378, PETRI_PLACES=220, PETRI_TRANSITIONS=221} [2025-01-10 01:11:08,280 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 161 predicate places. [2025-01-10 01:11:08,280 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 221 transitions, 2378 flow [2025-01-10 01:11:08,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:08,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:08,281 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:08,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-10 01:11:08,281 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:11:08,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:08,282 INFO L85 PathProgramCache]: Analyzing trace with hash 865615915, now seen corresponding path program 21 times [2025-01-10 01:11:08,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:08,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126398010] [2025-01-10 01:11:08,282 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:11:08,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:08,288 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-01-10 01:11:08,300 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 33 statements. [2025-01-10 01:11:08,301 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:11:08,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:08,573 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:08,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:08,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126398010] [2025-01-10 01:11:08,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126398010] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:08,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:08,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:11:08,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767819897] [2025-01-10 01:11:08,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:08,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:08,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:08,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:08,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:08,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:11:08,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 221 transitions, 2378 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:08,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:08,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:11:08,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:09,483 INFO L124 PetriNetUnfolderBase]: 3459/5844 cut-off events. [2025-01-10 01:11:09,483 INFO L125 PetriNetUnfolderBase]: For 100453/100453 co-relation queries the response was YES. [2025-01-10 01:11:09,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29635 conditions, 5844 events. 3459/5844 cut-off events. For 100453/100453 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 39275 event pairs, 1445 based on Foata normal form. 1/5715 useless extension candidates. Maximal degree in co-relation 29521. Up to 5046 conditions per place. [2025-01-10 01:11:09,543 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 228 selfloop transitions, 36 changer transitions 4/273 dead transitions. [2025-01-10 01:11:09,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 273 transitions, 3360 flow [2025-01-10 01:11:09,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:11:09,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:11:09,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 250 transitions. [2025-01-10 01:11:09,544 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3787878787878788 [2025-01-10 01:11:09,544 INFO L175 Difference]: Start difference. First operand has 220 places, 221 transitions, 2378 flow. Second operand 11 states and 250 transitions. [2025-01-10 01:11:09,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 273 transitions, 3360 flow [2025-01-10 01:11:09,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 273 transitions, 3110 flow, removed 109 selfloop flow, removed 4 redundant places. [2025-01-10 01:11:09,794 INFO L231 Difference]: Finished difference. Result has 229 places, 227 transitions, 2361 flow [2025-01-10 01:11:09,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2148, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2361, PETRI_PLACES=229, PETRI_TRANSITIONS=227} [2025-01-10 01:11:09,795 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 170 predicate places. [2025-01-10 01:11:09,795 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 227 transitions, 2361 flow [2025-01-10 01:11:09,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:09,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:09,795 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:09,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-10 01:11:09,795 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:11:09,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:09,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1109576795, now seen corresponding path program 22 times [2025-01-10 01:11:09,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:09,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127494900] [2025-01-10 01:11:09,797 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:11:09,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:09,803 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-01-10 01:11:09,819 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:11:09,820 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:11:09,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:10,200 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:10,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:10,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127494900] [2025-01-10 01:11:10,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127494900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:10,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:10,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:11:10,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357774412] [2025-01-10 01:11:10,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:10,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:10,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:10,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:10,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:10,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-01-10 01:11:10,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 227 transitions, 2361 flow. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:10,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:10,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-01-10 01:11:10,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:11,163 INFO L124 PetriNetUnfolderBase]: 3814/6375 cut-off events. [2025-01-10 01:11:11,165 INFO L125 PetriNetUnfolderBase]: For 96555/96555 co-relation queries the response was YES. [2025-01-10 01:11:11,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31557 conditions, 6375 events. 3814/6375 cut-off events. For 96555/96555 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 42715 event pairs, 1572 based on Foata normal form. 1/6246 useless extension candidates. Maximal degree in co-relation 31438. Up to 5315 conditions per place. [2025-01-10 01:11:11,217 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 248 selfloop transitions, 44 changer transitions 3/299 dead transitions. [2025-01-10 01:11:11,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 299 transitions, 3669 flow [2025-01-10 01:11:11,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:11:11,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:11:11,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 261 transitions. [2025-01-10 01:11:11,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39545454545454545 [2025-01-10 01:11:11,218 INFO L175 Difference]: Start difference. First operand has 229 places, 227 transitions, 2361 flow. Second operand 11 states and 261 transitions. [2025-01-10 01:11:11,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 299 transitions, 3669 flow [2025-01-10 01:11:11,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 299 transitions, 3517 flow, removed 56 selfloop flow, removed 6 redundant places. [2025-01-10 01:11:11,440 INFO L231 Difference]: Finished difference. Result has 237 places, 236 transitions, 2627 flow [2025-01-10 01:11:11,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2209, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2627, PETRI_PLACES=237, PETRI_TRANSITIONS=236} [2025-01-10 01:11:11,441 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 178 predicate places. [2025-01-10 01:11:11,441 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 236 transitions, 2627 flow [2025-01-10 01:11:11,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:11,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:11,441 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:11,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-10 01:11:11,442 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:11:11,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:11,442 INFO L85 PathProgramCache]: Analyzing trace with hash 918918261, now seen corresponding path program 23 times [2025-01-10 01:11:11,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:11,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106676182] [2025-01-10 01:11:11,442 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:11:11,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:11,447 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 3 equivalence classes. [2025-01-10 01:11:11,454 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:11:11,454 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:11:11,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:11,826 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:11,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:11,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106676182] [2025-01-10 01:11:11,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106676182] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:11,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:11,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:11:11,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805241805] [2025-01-10 01:11:11,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:11,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:11,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:11,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:11,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:11,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:11:11,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 236 transitions, 2627 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:11,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:11,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:11:11,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:12,789 INFO L124 PetriNetUnfolderBase]: 3729/6311 cut-off events. [2025-01-10 01:11:12,789 INFO L125 PetriNetUnfolderBase]: For 113433/113433 co-relation queries the response was YES. [2025-01-10 01:11:12,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32469 conditions, 6311 events. 3729/6311 cut-off events. For 113433/113433 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 43000 event pairs, 1591 based on Foata normal form. 1/6181 useless extension candidates. Maximal degree in co-relation 32345. Up to 5411 conditions per place. [2025-01-10 01:11:12,860 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 257 selfloop transitions, 35 changer transitions 3/300 dead transitions. [2025-01-10 01:11:12,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 300 transitions, 3941 flow [2025-01-10 01:11:12,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:11:12,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:11:12,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 260 transitions. [2025-01-10 01:11:12,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2025-01-10 01:11:12,861 INFO L175 Difference]: Start difference. First operand has 237 places, 236 transitions, 2627 flow. Second operand 11 states and 260 transitions. [2025-01-10 01:11:12,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 300 transitions, 3941 flow [2025-01-10 01:11:13,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 300 transitions, 3695 flow, removed 104 selfloop flow, removed 5 redundant places. [2025-01-10 01:11:13,149 INFO L231 Difference]: Finished difference. Result has 246 places, 243 transitions, 2725 flow [2025-01-10 01:11:13,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2387, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2725, PETRI_PLACES=246, PETRI_TRANSITIONS=243} [2025-01-10 01:11:13,150 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 187 predicate places. [2025-01-10 01:11:13,150 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 243 transitions, 2725 flow [2025-01-10 01:11:13,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:13,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:13,150 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:13,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-10 01:11:13,151 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:11:13,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:13,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1405697869, now seen corresponding path program 24 times [2025-01-10 01:11:13,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:13,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526198642] [2025-01-10 01:11:13,152 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:11:13,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:13,158 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 3 equivalence classes. [2025-01-10 01:11:13,179 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:11:13,182 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-10 01:11:13,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:13,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:13,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:13,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526198642] [2025-01-10 01:11:13,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526198642] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:13,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:13,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:11:13,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347643326] [2025-01-10 01:11:13,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:13,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:13,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:13,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:13,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:13,535 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:11:13,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 243 transitions, 2725 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:13,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:13,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:11:13,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:14,575 INFO L124 PetriNetUnfolderBase]: 3834/6524 cut-off events. [2025-01-10 01:11:14,576 INFO L125 PetriNetUnfolderBase]: For 126746/126746 co-relation queries the response was YES. [2025-01-10 01:11:14,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33548 conditions, 6524 events. 3834/6524 cut-off events. For 126746/126746 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 45353 event pairs, 1616 based on Foata normal form. 1/6378 useless extension candidates. Maximal degree in co-relation 33418. Up to 5589 conditions per place. [2025-01-10 01:11:14,644 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 263 selfloop transitions, 35 changer transitions 3/306 dead transitions. [2025-01-10 01:11:14,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 306 transitions, 3977 flow [2025-01-10 01:11:14,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:11:14,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:11:14,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 260 transitions. [2025-01-10 01:11:14,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2025-01-10 01:11:14,645 INFO L175 Difference]: Start difference. First operand has 246 places, 243 transitions, 2725 flow. Second operand 11 states and 260 transitions. [2025-01-10 01:11:14,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 306 transitions, 3977 flow [2025-01-10 01:11:14,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 306 transitions, 3743 flow, removed 100 selfloop flow, removed 5 redundant places. [2025-01-10 01:11:14,943 INFO L231 Difference]: Finished difference. Result has 254 places, 249 transitions, 2758 flow [2025-01-10 01:11:14,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2491, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2758, PETRI_PLACES=254, PETRI_TRANSITIONS=249} [2025-01-10 01:11:14,944 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 195 predicate places. [2025-01-10 01:11:14,944 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 249 transitions, 2758 flow [2025-01-10 01:11:14,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:14,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:14,945 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:14,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-10 01:11:14,945 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:11:14,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:14,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1106710775, now seen corresponding path program 25 times [2025-01-10 01:11:14,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:14,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247263212] [2025-01-10 01:11:14,946 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:11:14,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:14,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:11:14,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:11:14,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:14,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:15,380 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:15,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:15,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247263212] [2025-01-10 01:11:15,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247263212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:15,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:15,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:11:15,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911087315] [2025-01-10 01:11:15,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:15,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:15,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:15,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:15,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:15,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:11:15,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 249 transitions, 2758 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:15,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:15,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:11:15,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:16,435 INFO L124 PetriNetUnfolderBase]: 3834/6516 cut-off events. [2025-01-10 01:11:16,435 INFO L125 PetriNetUnfolderBase]: For 124803/124803 co-relation queries the response was YES. [2025-01-10 01:11:16,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33200 conditions, 6516 events. 3834/6516 cut-off events. For 124803/124803 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 45216 event pairs, 1640 based on Foata normal form. 1/6368 useless extension candidates. Maximal degree in co-relation 33066. Up to 5666 conditions per place. [2025-01-10 01:11:16,501 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 259 selfloop transitions, 34 changer transitions 3/301 dead transitions. [2025-01-10 01:11:16,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 301 transitions, 3809 flow [2025-01-10 01:11:16,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:11:16,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:11:16,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 251 transitions. [2025-01-10 01:11:16,503 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3803030303030303 [2025-01-10 01:11:16,503 INFO L175 Difference]: Start difference. First operand has 254 places, 249 transitions, 2758 flow. Second operand 11 states and 251 transitions. [2025-01-10 01:11:16,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 301 transitions, 3809 flow [2025-01-10 01:11:16,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 301 transitions, 3616 flow, removed 78 selfloop flow, removed 6 redundant places. [2025-01-10 01:11:16,786 INFO L231 Difference]: Finished difference. Result has 260 places, 252 transitions, 2698 flow [2025-01-10 01:11:16,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2565, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2698, PETRI_PLACES=260, PETRI_TRANSITIONS=252} [2025-01-10 01:11:16,788 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 201 predicate places. [2025-01-10 01:11:16,791 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 252 transitions, 2698 flow [2025-01-10 01:11:16,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:16,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:16,792 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:16,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-10 01:11:16,792 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:11:16,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:16,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1325537673, now seen corresponding path program 26 times [2025-01-10 01:11:16,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:16,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839383193] [2025-01-10 01:11:16,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:11:16,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:16,802 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-10 01:11:16,816 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:11:16,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:11:16,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:17,351 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:17,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:17,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839383193] [2025-01-10 01:11:17,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839383193] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:17,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:17,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:11:17,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226764362] [2025-01-10 01:11:17,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:17,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:17,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:17,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:17,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:17,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:11:17,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 252 transitions, 2698 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:17,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:17,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:11:17,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:18,500 INFO L124 PetriNetUnfolderBase]: 3951/6715 cut-off events. [2025-01-10 01:11:18,501 INFO L125 PetriNetUnfolderBase]: For 132213/132213 co-relation queries the response was YES. [2025-01-10 01:11:18,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34527 conditions, 6715 events. 3951/6715 cut-off events. For 132213/132213 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 46749 event pairs, 1730 based on Foata normal form. 1/6575 useless extension candidates. Maximal degree in co-relation 34390. Up to 5752 conditions per place. [2025-01-10 01:11:18,566 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 274 selfloop transitions, 38 changer transitions 3/320 dead transitions. [2025-01-10 01:11:18,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 320 transitions, 4071 flow [2025-01-10 01:11:18,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:11:18,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:11:18,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 263 transitions. [2025-01-10 01:11:18,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3984848484848485 [2025-01-10 01:11:18,567 INFO L175 Difference]: Start difference. First operand has 260 places, 252 transitions, 2698 flow. Second operand 11 states and 263 transitions. [2025-01-10 01:11:18,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 320 transitions, 4071 flow [2025-01-10 01:11:18,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 320 transitions, 3943 flow, removed 32 selfloop flow, removed 8 redundant places. [2025-01-10 01:11:18,811 INFO L231 Difference]: Finished difference. Result has 266 places, 260 transitions, 2933 flow [2025-01-10 01:11:18,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2570, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2933, PETRI_PLACES=266, PETRI_TRANSITIONS=260} [2025-01-10 01:11:18,812 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 207 predicate places. [2025-01-10 01:11:18,812 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 260 transitions, 2933 flow [2025-01-10 01:11:18,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:18,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:18,813 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:18,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-10 01:11:18,813 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:11:18,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:18,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1697395065, now seen corresponding path program 27 times [2025-01-10 01:11:18,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:18,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557572315] [2025-01-10 01:11:18,814 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:11:18,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:18,820 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-01-10 01:11:18,828 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 33 statements. [2025-01-10 01:11:18,829 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:11:18,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:19,106 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:19,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:19,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557572315] [2025-01-10 01:11:19,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557572315] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:19,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:19,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:11:19,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36408089] [2025-01-10 01:11:19,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:19,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:19,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:19,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:19,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:19,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:11:19,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 260 transitions, 2933 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:19,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:19,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:11:19,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:20,086 INFO L124 PetriNetUnfolderBase]: 3951/6718 cut-off events. [2025-01-10 01:11:20,086 INFO L125 PetriNetUnfolderBase]: For 142134/142134 co-relation queries the response was YES. [2025-01-10 01:11:20,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35058 conditions, 6718 events. 3951/6718 cut-off events. For 142134/142134 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 46929 event pairs, 1709 based on Foata normal form. 1/6578 useless extension candidates. Maximal degree in co-relation 34917. Up to 5701 conditions per place. [2025-01-10 01:11:20,163 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 273 selfloop transitions, 41 changer transitions 5/324 dead transitions. [2025-01-10 01:11:20,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 324 transitions, 4083 flow [2025-01-10 01:11:20,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:11:20,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:11:20,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 269 transitions. [2025-01-10 01:11:20,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4075757575757576 [2025-01-10 01:11:20,164 INFO L175 Difference]: Start difference. First operand has 266 places, 260 transitions, 2933 flow. Second operand 11 states and 269 transitions. [2025-01-10 01:11:20,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 324 transitions, 4083 flow [2025-01-10 01:11:20,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 324 transitions, 3874 flow, removed 92 selfloop flow, removed 5 redundant places. [2025-01-10 01:11:20,408 INFO L231 Difference]: Finished difference. Result has 273 places, 264 transitions, 2879 flow [2025-01-10 01:11:20,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2724, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2879, PETRI_PLACES=273, PETRI_TRANSITIONS=264} [2025-01-10 01:11:20,409 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 214 predicate places. [2025-01-10 01:11:20,409 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 264 transitions, 2879 flow [2025-01-10 01:11:20,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:20,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:20,409 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:20,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-10 01:11:20,409 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:11:20,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:20,410 INFO L85 PathProgramCache]: Analyzing trace with hash -953347407, now seen corresponding path program 28 times [2025-01-10 01:11:20,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:20,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866038050] [2025-01-10 01:11:20,410 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:11:20,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:20,414 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-01-10 01:11:20,423 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:11:20,423 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:11:20,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:20,731 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:20,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:20,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866038050] [2025-01-10 01:11:20,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866038050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:20,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:20,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:11:20,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367296973] [2025-01-10 01:11:20,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:20,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:20,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:20,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:20,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:20,756 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-01-10 01:11:20,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 264 transitions, 2879 flow. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:20,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:20,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-01-10 01:11:20,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:22,120 INFO L124 PetriNetUnfolderBase]: 4206/7117 cut-off events. [2025-01-10 01:11:22,121 INFO L125 PetriNetUnfolderBase]: For 142655/142655 co-relation queries the response was YES. [2025-01-10 01:11:22,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36441 conditions, 7117 events. 4206/7117 cut-off events. For 142655/142655 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 49987 event pairs, 1835 based on Foata normal form. 1/6959 useless extension candidates. Maximal degree in co-relation 36297. Up to 6056 conditions per place. [2025-01-10 01:11:22,196 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 278 selfloop transitions, 41 changer transitions 3/326 dead transitions. [2025-01-10 01:11:22,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 326 transitions, 4072 flow [2025-01-10 01:11:22,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:11:22,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:11:22,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 255 transitions. [2025-01-10 01:11:22,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2025-01-10 01:11:22,198 INFO L175 Difference]: Start difference. First operand has 273 places, 264 transitions, 2879 flow. Second operand 11 states and 255 transitions. [2025-01-10 01:11:22,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 326 transitions, 4072 flow [2025-01-10 01:11:22,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 326 transitions, 3937 flow, removed 32 selfloop flow, removed 7 redundant places. [2025-01-10 01:11:22,588 INFO L231 Difference]: Finished difference. Result has 279 places, 269 transitions, 2969 flow [2025-01-10 01:11:22,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2744, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2969, PETRI_PLACES=279, PETRI_TRANSITIONS=269} [2025-01-10 01:11:22,589 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 220 predicate places. [2025-01-10 01:11:22,589 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 269 transitions, 2969 flow [2025-01-10 01:11:22,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:22,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:22,590 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:22,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-10 01:11:22,590 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:11:22,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:22,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1461558491, now seen corresponding path program 29 times [2025-01-10 01:11:22,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:22,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582561030] [2025-01-10 01:11:22,591 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:11:22,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:22,597 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 3 equivalence classes. [2025-01-10 01:11:22,606 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:11:22,606 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:11:22,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:22,959 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:22,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:22,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582561030] [2025-01-10 01:11:22,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582561030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:22,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:22,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:11:22,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574400688] [2025-01-10 01:11:22,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:22,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:22,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:22,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:22,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:22,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:11:22,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 269 transitions, 2969 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:22,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:22,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:11:22,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:24,049 INFO L124 PetriNetUnfolderBase]: 4008/6847 cut-off events. [2025-01-10 01:11:24,049 INFO L125 PetriNetUnfolderBase]: For 134847/134847 co-relation queries the response was YES. [2025-01-10 01:11:24,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34938 conditions, 6847 events. 4008/6847 cut-off events. For 134847/134847 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 48430 event pairs, 1739 based on Foata normal form. 1/6693 useless extension candidates. Maximal degree in co-relation 34790. Up to 5920 conditions per place. [2025-01-10 01:11:24,114 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 273 selfloop transitions, 41 changer transitions 4/323 dead transitions. [2025-01-10 01:11:24,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 323 transitions, 4040 flow [2025-01-10 01:11:24,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:11:24,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:11:24,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 256 transitions. [2025-01-10 01:11:24,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2025-01-10 01:11:24,115 INFO L175 Difference]: Start difference. First operand has 279 places, 269 transitions, 2969 flow. Second operand 11 states and 256 transitions. [2025-01-10 01:11:24,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 323 transitions, 4040 flow [2025-01-10 01:11:24,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 323 transitions, 3913 flow, removed 28 selfloop flow, removed 7 redundant places. [2025-01-10 01:11:24,394 INFO L231 Difference]: Finished difference. Result has 284 places, 273 transitions, 3012 flow [2025-01-10 01:11:24,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2842, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3012, PETRI_PLACES=284, PETRI_TRANSITIONS=273} [2025-01-10 01:11:24,395 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 225 predicate places. [2025-01-10 01:11:24,395 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 273 transitions, 3012 flow [2025-01-10 01:11:24,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:24,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:24,395 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:24,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-10 01:11:24,395 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:11:24,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:24,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1395008105, now seen corresponding path program 30 times [2025-01-10 01:11:24,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:24,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311403159] [2025-01-10 01:11:24,396 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:11:24,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:24,401 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 3 equivalence classes. [2025-01-10 01:11:24,408 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:11:24,408 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-10 01:11:24,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:24,671 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:24,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:24,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311403159] [2025-01-10 01:11:24,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311403159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:24,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:24,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:11:24,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914187921] [2025-01-10 01:11:24,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:24,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:24,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:24,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:24,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:24,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:11:24,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 273 transitions, 3012 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:24,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:24,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:11:24,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:25,664 INFO L124 PetriNetUnfolderBase]: 4008/6841 cut-off events. [2025-01-10 01:11:25,664 INFO L125 PetriNetUnfolderBase]: For 135222/135222 co-relation queries the response was YES. [2025-01-10 01:11:25,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34951 conditions, 6841 events. 4008/6841 cut-off events. For 135222/135222 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 48429 event pairs, 1786 based on Foata normal form. 1/6689 useless extension candidates. Maximal degree in co-relation 34800. Up to 5998 conditions per place. [2025-01-10 01:11:25,757 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 276 selfloop transitions, 35 changer transitions 3/319 dead transitions. [2025-01-10 01:11:25,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 319 transitions, 4000 flow [2025-01-10 01:11:25,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:11:25,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:11:25,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 247 transitions. [2025-01-10 01:11:25,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37424242424242427 [2025-01-10 01:11:25,758 INFO L175 Difference]: Start difference. First operand has 284 places, 273 transitions, 3012 flow. Second operand 11 states and 247 transitions. [2025-01-10 01:11:25,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 319 transitions, 4000 flow [2025-01-10 01:11:26,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 319 transitions, 3846 flow, removed 38 selfloop flow, removed 8 redundant places. [2025-01-10 01:11:26,042 INFO L231 Difference]: Finished difference. Result has 288 places, 275 transitions, 2954 flow [2025-01-10 01:11:26,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2858, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2954, PETRI_PLACES=288, PETRI_TRANSITIONS=275} [2025-01-10 01:11:26,043 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 229 predicate places. [2025-01-10 01:11:26,043 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 275 transitions, 2954 flow [2025-01-10 01:11:26,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:26,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:26,044 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:26,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-01-10 01:11:26,044 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:11:26,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:26,045 INFO L85 PathProgramCache]: Analyzing trace with hash 855098555, now seen corresponding path program 31 times [2025-01-10 01:11:26,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:26,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33382395] [2025-01-10 01:11:26,045 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:11:26,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:26,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:11:26,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:11:26,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:26,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:26,413 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:26,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:26,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33382395] [2025-01-10 01:11:26,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33382395] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:26,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:26,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:11:26,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811589649] [2025-01-10 01:11:26,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:26,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:26,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:26,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:26,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:26,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:11:26,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 275 transitions, 2954 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:26,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:26,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:11:26,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:27,469 INFO L124 PetriNetUnfolderBase]: 4139/7047 cut-off events. [2025-01-10 01:11:27,469 INFO L125 PetriNetUnfolderBase]: For 149927/149927 co-relation queries the response was YES. [2025-01-10 01:11:27,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36680 conditions, 7047 events. 4139/7047 cut-off events. For 149927/149927 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 49917 event pairs, 1856 based on Foata normal form. 1/6895 useless extension candidates. Maximal degree in co-relation 36527. Up to 6111 conditions per place. [2025-01-10 01:11:27,562 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 292 selfloop transitions, 35 changer transitions 3/335 dead transitions. [2025-01-10 01:11:27,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 335 transitions, 4487 flow [2025-01-10 01:11:27,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:11:27,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:11:27,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 257 transitions. [2025-01-10 01:11:27,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3893939393939394 [2025-01-10 01:11:27,564 INFO L175 Difference]: Start difference. First operand has 288 places, 275 transitions, 2954 flow. Second operand 11 states and 257 transitions. [2025-01-10 01:11:27,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 335 transitions, 4487 flow [2025-01-10 01:11:27,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 335 transitions, 4421 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-10 01:11:27,865 INFO L231 Difference]: Finished difference. Result has 294 places, 284 transitions, 3391 flow [2025-01-10 01:11:27,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2888, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3391, PETRI_PLACES=294, PETRI_TRANSITIONS=284} [2025-01-10 01:11:27,866 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 235 predicate places. [2025-01-10 01:11:27,866 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 284 transitions, 3391 flow [2025-01-10 01:11:27,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:27,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:27,866 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:27,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-01-10 01:11:27,866 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:11:27,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:27,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1597965553, now seen corresponding path program 32 times [2025-01-10 01:11:27,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:27,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040289797] [2025-01-10 01:11:27,867 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:11:27,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:27,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-10 01:11:27,879 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:11:27,879 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:11:27,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:28,180 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:28,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:28,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040289797] [2025-01-10 01:11:28,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040289797] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:28,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:28,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:11:28,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767543771] [2025-01-10 01:11:28,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:28,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:28,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:28,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:28,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:28,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:11:28,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 284 transitions, 3391 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:28,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:28,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:11:28,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:29,366 INFO L124 PetriNetUnfolderBase]: 4322/7366 cut-off events. [2025-01-10 01:11:29,366 INFO L125 PetriNetUnfolderBase]: For 204126/204126 co-relation queries the response was YES. [2025-01-10 01:11:29,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40898 conditions, 7366 events. 4322/7366 cut-off events. For 204126/204126 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 52934 event pairs, 1859 based on Foata normal form. 1/7195 useless extension candidates. Maximal degree in co-relation 40741. Up to 6300 conditions per place. [2025-01-10 01:11:29,456 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 310 selfloop transitions, 38 changer transitions 3/356 dead transitions. [2025-01-10 01:11:29,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 356 transitions, 5054 flow [2025-01-10 01:11:29,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:11:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:11:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 270 transitions. [2025-01-10 01:11:29,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-01-10 01:11:29,457 INFO L175 Difference]: Start difference. First operand has 294 places, 284 transitions, 3391 flow. Second operand 11 states and 270 transitions. [2025-01-10 01:11:29,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 356 transitions, 5054 flow [2025-01-10 01:11:29,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 356 transitions, 4696 flow, removed 163 selfloop flow, removed 5 redundant places. [2025-01-10 01:11:29,867 INFO L231 Difference]: Finished difference. Result has 304 places, 295 transitions, 3573 flow [2025-01-10 01:11:29,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3033, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3573, PETRI_PLACES=304, PETRI_TRANSITIONS=295} [2025-01-10 01:11:29,867 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 245 predicate places. [2025-01-10 01:11:29,867 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 295 transitions, 3573 flow [2025-01-10 01:11:29,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:29,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:29,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:29,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-01-10 01:11:29,868 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:11:29,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:29,869 INFO L85 PathProgramCache]: Analyzing trace with hash 80459705, now seen corresponding path program 33 times [2025-01-10 01:11:29,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:29,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424513062] [2025-01-10 01:11:29,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:11:29,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:29,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-01-10 01:11:29,880 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 33 statements. [2025-01-10 01:11:29,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:11:29,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:30,109 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:30,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:30,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424513062] [2025-01-10 01:11:30,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424513062] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:30,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:30,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:11:30,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843334906] [2025-01-10 01:11:30,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:30,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:30,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:30,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:30,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:30,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:11:30,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 295 transitions, 3573 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:30,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:30,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:11:30,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:31,280 INFO L124 PetriNetUnfolderBase]: 4383/7474 cut-off events. [2025-01-10 01:11:31,281 INFO L125 PetriNetUnfolderBase]: For 210283/210283 co-relation queries the response was YES. [2025-01-10 01:11:31,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41268 conditions, 7474 events. 4383/7474 cut-off events. For 210283/210283 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 54012 event pairs, 1963 based on Foata normal form. 1/7305 useless extension candidates. Maximal degree in co-relation 41105. Up to 6570 conditions per place. [2025-01-10 01:11:31,363 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 300 selfloop transitions, 35 changer transitions 4/344 dead transitions. [2025-01-10 01:11:31,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 344 transitions, 4751 flow [2025-01-10 01:11:31,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:11:31,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:11:31,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 249 transitions. [2025-01-10 01:11:31,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37727272727272726 [2025-01-10 01:11:31,364 INFO L175 Difference]: Start difference. First operand has 304 places, 295 transitions, 3573 flow. Second operand 11 states and 249 transitions. [2025-01-10 01:11:31,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 344 transitions, 4751 flow [2025-01-10 01:11:31,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 344 transitions, 4433 flow, removed 144 selfloop flow, removed 4 redundant places. [2025-01-10 01:11:31,926 INFO L231 Difference]: Finished difference. Result has 313 places, 301 transitions, 3522 flow [2025-01-10 01:11:31,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3255, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3522, PETRI_PLACES=313, PETRI_TRANSITIONS=301} [2025-01-10 01:11:31,927 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 254 predicate places. [2025-01-10 01:11:31,927 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 301 transitions, 3522 flow [2025-01-10 01:11:31,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:31,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:31,927 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:31,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-01-10 01:11:31,927 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:11:31,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:31,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1894733005, now seen corresponding path program 34 times [2025-01-10 01:11:31,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:31,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137033114] [2025-01-10 01:11:31,928 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:11:31,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:31,936 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-01-10 01:11:31,944 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:11:31,944 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:11:31,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:32,241 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:32,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:32,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137033114] [2025-01-10 01:11:32,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137033114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:32,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:32,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:11:32,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490714769] [2025-01-10 01:11:32,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:32,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:32,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:32,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:32,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:32,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-01-10 01:11:32,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 301 transitions, 3522 flow. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:32,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:32,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-01-10 01:11:32,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:34,091 INFO L124 PetriNetUnfolderBase]: 4753/8033 cut-off events. [2025-01-10 01:11:34,091 INFO L125 PetriNetUnfolderBase]: For 226755/226755 co-relation queries the response was YES. [2025-01-10 01:11:34,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44124 conditions, 8033 events. 4753/8033 cut-off events. For 226755/226755 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 57949 event pairs, 2077 based on Foata normal form. 1/7863 useless extension candidates. Maximal degree in co-relation 43956. Up to 6839 conditions per place. [2025-01-10 01:11:34,189 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 321 selfloop transitions, 43 changer transitions 3/371 dead transitions. [2025-01-10 01:11:34,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 371 transitions, 5176 flow [2025-01-10 01:11:34,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:11:34,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:11:34,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 261 transitions. [2025-01-10 01:11:34,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39545454545454545 [2025-01-10 01:11:34,191 INFO L175 Difference]: Start difference. First operand has 313 places, 301 transitions, 3522 flow. Second operand 11 states and 261 transitions. [2025-01-10 01:11:34,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 371 transitions, 5176 flow [2025-01-10 01:11:34,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 371 transitions, 4948 flow, removed 95 selfloop flow, removed 6 redundant places. [2025-01-10 01:11:34,749 INFO L231 Difference]: Finished difference. Result has 321 places, 310 transitions, 3846 flow [2025-01-10 01:11:34,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3294, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3846, PETRI_PLACES=321, PETRI_TRANSITIONS=310} [2025-01-10 01:11:34,749 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 262 predicate places. [2025-01-10 01:11:34,750 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 310 transitions, 3846 flow [2025-01-10 01:11:34,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:34,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:34,750 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:34,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-01-10 01:11:34,750 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:11:34,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:34,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1376541985, now seen corresponding path program 35 times [2025-01-10 01:11:34,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:34,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217459338] [2025-01-10 01:11:34,751 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:11:34,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:34,757 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 3 equivalence classes. [2025-01-10 01:11:34,765 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:11:34,765 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:11:34,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:35,259 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:35,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:35,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217459338] [2025-01-10 01:11:35,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217459338] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:35,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:35,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:11:35,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029451966] [2025-01-10 01:11:35,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:35,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:35,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:35,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:35,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:35,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:11:35,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 310 transitions, 3846 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:35,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:35,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:11:35,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:36,680 INFO L124 PetriNetUnfolderBase]: 4618/7867 cut-off events. [2025-01-10 01:11:36,680 INFO L125 PetriNetUnfolderBase]: For 248158/248158 co-relation queries the response was YES. [2025-01-10 01:11:36,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44388 conditions, 7867 events. 4618/7867 cut-off events. For 248158/248158 co-relation queries the response was YES. Maximal size of possible extension queue 709. Compared 57470 event pairs, 2073 based on Foata normal form. 1/7701 useless extension candidates. Maximal degree in co-relation 44215. Up to 6861 conditions per place. [2025-01-10 01:11:36,763 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 327 selfloop transitions, 34 changer transitions 3/369 dead transitions. [2025-01-10 01:11:36,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 369 transitions, 5319 flow [2025-01-10 01:11:36,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:11:36,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:11:36,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 259 transitions. [2025-01-10 01:11:36,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3924242424242424 [2025-01-10 01:11:36,765 INFO L175 Difference]: Start difference. First operand has 321 places, 310 transitions, 3846 flow. Second operand 11 states and 259 transitions. [2025-01-10 01:11:36,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 369 transitions, 5319 flow [2025-01-10 01:11:37,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 369 transitions, 4973 flow, removed 155 selfloop flow, removed 5 redundant places. [2025-01-10 01:11:37,655 INFO L231 Difference]: Finished difference. Result has 329 places, 315 transitions, 3824 flow [2025-01-10 01:11:37,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3504, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3824, PETRI_PLACES=329, PETRI_TRANSITIONS=315} [2025-01-10 01:11:37,659 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 270 predicate places. [2025-01-10 01:11:37,660 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 315 transitions, 3824 flow [2025-01-10 01:11:37,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:37,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:37,660 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:37,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-01-10 01:11:37,660 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:11:37,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:37,661 INFO L85 PathProgramCache]: Analyzing trace with hash 321554565, now seen corresponding path program 36 times [2025-01-10 01:11:37,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:37,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044341183] [2025-01-10 01:11:37,661 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:11:37,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:37,680 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 3 equivalence classes. [2025-01-10 01:11:37,707 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:11:37,708 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-10 01:11:37,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:38,243 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:38,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:38,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044341183] [2025-01-10 01:11:38,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044341183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:38,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:38,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:11:38,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419554056] [2025-01-10 01:11:38,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:38,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:38,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:38,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:38,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:38,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:11:38,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 315 transitions, 3824 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:38,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:38,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:11:38,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:39,865 INFO L124 PetriNetUnfolderBase]: 4639/7895 cut-off events. [2025-01-10 01:11:39,868 INFO L125 PetriNetUnfolderBase]: For 236847/236847 co-relation queries the response was YES. [2025-01-10 01:11:39,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43498 conditions, 7895 events. 4639/7895 cut-off events. For 236847/236847 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 57669 event pairs, 2096 based on Foata normal form. 1/7728 useless extension candidates. Maximal degree in co-relation 43320. Up to 6857 conditions per place. [2025-01-10 01:11:39,978 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 328 selfloop transitions, 37 changer transitions 4/374 dead transitions. [2025-01-10 01:11:39,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 374 transitions, 5156 flow [2025-01-10 01:11:39,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:11:39,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:11:39,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 262 transitions. [2025-01-10 01:11:39,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.396969696969697 [2025-01-10 01:11:39,980 INFO L175 Difference]: Start difference. First operand has 329 places, 315 transitions, 3824 flow. Second operand 11 states and 262 transitions. [2025-01-10 01:11:39,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 374 transitions, 5156 flow [2025-01-10 01:11:40,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 374 transitions, 4899 flow, removed 111 selfloop flow, removed 6 redundant places. [2025-01-10 01:11:40,648 INFO L231 Difference]: Finished difference. Result has 336 places, 320 transitions, 3813 flow [2025-01-10 01:11:40,648 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3567, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3813, PETRI_PLACES=336, PETRI_TRANSITIONS=320} [2025-01-10 01:11:40,649 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 277 predicate places. [2025-01-10 01:11:40,649 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 320 transitions, 3813 flow [2025-01-10 01:11:40,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:40,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:40,649 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:40,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-01-10 01:11:40,650 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:11:40,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:40,650 INFO L85 PathProgramCache]: Analyzing trace with hash 540381463, now seen corresponding path program 37 times [2025-01-10 01:11:40,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:40,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94709773] [2025-01-10 01:11:40,650 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:11:40,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:40,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:11:40,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:11:40,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:40,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:41,034 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:41,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:41,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94709773] [2025-01-10 01:11:41,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94709773] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:41,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:41,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:11:41,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101619385] [2025-01-10 01:11:41,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:41,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:41,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:41,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:41,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:41,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:11:41,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 320 transitions, 3813 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:41,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:41,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:11:41,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:43,024 INFO L124 PetriNetUnfolderBase]: 4702/8009 cut-off events. [2025-01-10 01:11:43,025 INFO L125 PetriNetUnfolderBase]: For 242001/242001 co-relation queries the response was YES. [2025-01-10 01:11:43,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44168 conditions, 8009 events. 4702/8009 cut-off events. For 242001/242001 co-relation queries the response was YES. Maximal size of possible extension queue 718. Compared 58598 event pairs, 2139 based on Foata normal form. 1/7844 useless extension candidates. Maximal degree in co-relation 43986. Up to 6987 conditions per place. [2025-01-10 01:11:43,121 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 335 selfloop transitions, 35 changer transitions 3/378 dead transitions. [2025-01-10 01:11:43,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 378 transitions, 5323 flow [2025-01-10 01:11:43,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:11:43,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:11:43,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 259 transitions. [2025-01-10 01:11:43,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3924242424242424 [2025-01-10 01:11:43,123 INFO L175 Difference]: Start difference. First operand has 336 places, 320 transitions, 3813 flow. Second operand 11 states and 259 transitions. [2025-01-10 01:11:43,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 378 transitions, 5323 flow [2025-01-10 01:11:43,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 378 transitions, 5196 flow, removed 32 selfloop flow, removed 7 redundant places. [2025-01-10 01:11:43,775 INFO L231 Difference]: Finished difference. Result has 342 places, 325 transitions, 4024 flow [2025-01-10 01:11:43,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3686, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4024, PETRI_PLACES=342, PETRI_TRANSITIONS=325} [2025-01-10 01:11:43,776 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 283 predicate places. [2025-01-10 01:11:43,776 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 325 transitions, 4024 flow [2025-01-10 01:11:43,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:43,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:43,776 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:43,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-01-10 01:11:43,776 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:11:43,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:43,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1893815077, now seen corresponding path program 38 times [2025-01-10 01:11:43,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:43,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55205228] [2025-01-10 01:11:43,777 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:11:43,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:43,786 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-10 01:11:43,796 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:11:43,797 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:11:43,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:44,100 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:44,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:44,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55205228] [2025-01-10 01:11:44,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55205228] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:44,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:44,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:11:44,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238680254] [2025-01-10 01:11:44,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:44,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:44,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:44,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:44,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:44,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:11:44,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 325 transitions, 4024 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:44,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:44,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:11:44,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:45,847 INFO L124 PetriNetUnfolderBase]: 4702/8012 cut-off events. [2025-01-10 01:11:45,847 INFO L125 PetriNetUnfolderBase]: For 253577/253577 co-relation queries the response was YES. [2025-01-10 01:11:45,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44488 conditions, 8012 events. 4702/8012 cut-off events. For 253577/253577 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 58717 event pairs, 2108 based on Foata normal form. 1/7847 useless extension candidates. Maximal degree in co-relation 44302. Up to 6905 conditions per place. [2025-01-10 01:11:45,952 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 336 selfloop transitions, 40 changer transitions 5/386 dead transitions. [2025-01-10 01:11:45,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 386 transitions, 5330 flow [2025-01-10 01:11:45,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:11:45,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:11:45,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 268 transitions. [2025-01-10 01:11:45,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2025-01-10 01:11:45,954 INFO L175 Difference]: Start difference. First operand has 342 places, 325 transitions, 4024 flow. Second operand 11 states and 268 transitions. [2025-01-10 01:11:45,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 386 transitions, 5330 flow [2025-01-10 01:11:46,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 386 transitions, 5054 flow, removed 120 selfloop flow, removed 6 redundant places. [2025-01-10 01:11:46,761 INFO L231 Difference]: Finished difference. Result has 348 places, 329 transitions, 3921 flow [2025-01-10 01:11:46,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3748, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3921, PETRI_PLACES=348, PETRI_TRANSITIONS=329} [2025-01-10 01:11:46,762 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 289 predicate places. [2025-01-10 01:11:46,762 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 329 transitions, 3921 flow [2025-01-10 01:11:46,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:46,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:46,762 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:46,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-01-10 01:11:46,762 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:11:46,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:46,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1738503617, now seen corresponding path program 39 times [2025-01-10 01:11:46,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:46,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209233975] [2025-01-10 01:11:46,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:11:46,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:46,770 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-01-10 01:11:46,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 33 statements. [2025-01-10 01:11:46,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:11:46,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:47,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:47,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209233975] [2025-01-10 01:11:47,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209233975] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:47,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:47,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:11:47,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274721429] [2025-01-10 01:11:47,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:47,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:47,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:47,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:47,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:47,094 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:11:47,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 329 transitions, 3921 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:47,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:47,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:11:47,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:48,529 INFO L124 PetriNetUnfolderBase]: 4759/8123 cut-off events. [2025-01-10 01:11:48,529 INFO L125 PetriNetUnfolderBase]: For 239018/239018 co-relation queries the response was YES. [2025-01-10 01:11:48,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44202 conditions, 8123 events. 4759/8123 cut-off events. For 239018/239018 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 59801 event pairs, 2178 based on Foata normal form. 1/7954 useless extension candidates. Maximal degree in co-relation 44013. Up to 7018 conditions per place. [2025-01-10 01:11:48,636 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 338 selfloop transitions, 40 changer transitions 3/386 dead transitions. [2025-01-10 01:11:48,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 386 transitions, 5286 flow [2025-01-10 01:11:48,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:11:48,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:11:48,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 262 transitions. [2025-01-10 01:11:48,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.396969696969697 [2025-01-10 01:11:48,638 INFO L175 Difference]: Start difference. First operand has 348 places, 329 transitions, 3921 flow. Second operand 11 states and 262 transitions. [2025-01-10 01:11:48,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 386 transitions, 5286 flow [2025-01-10 01:11:49,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 386 transitions, 5121 flow, removed 48 selfloop flow, removed 7 redundant places. [2025-01-10 01:11:49,203 INFO L231 Difference]: Finished difference. Result has 354 places, 334 transitions, 4021 flow [2025-01-10 01:11:49,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3756, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4021, PETRI_PLACES=354, PETRI_TRANSITIONS=334} [2025-01-10 01:11:49,203 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 295 predicate places. [2025-01-10 01:11:49,204 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 334 transitions, 4021 flow [2025-01-10 01:11:49,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:49,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:49,204 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:49,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-01-10 01:11:49,207 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:11:49,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:49,207 INFO L85 PathProgramCache]: Analyzing trace with hash 2048252595, now seen corresponding path program 40 times [2025-01-10 01:11:49,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:49,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921936832] [2025-01-10 01:11:49,208 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:11:49,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:49,216 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-01-10 01:11:49,231 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:11:49,232 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:11:49,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:49,506 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:49,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:49,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921936832] [2025-01-10 01:11:49,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921936832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:49,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:49,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:11:49,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814584616] [2025-01-10 01:11:49,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:49,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:49,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:49,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:49,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:49,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-01-10 01:11:49,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 334 transitions, 4021 flow. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:49,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:49,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-01-10 01:11:49,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:51,461 INFO L124 PetriNetUnfolderBase]: 4957/8406 cut-off events. [2025-01-10 01:11:51,461 INFO L125 PetriNetUnfolderBase]: For 253241/253241 co-relation queries the response was YES. [2025-01-10 01:11:51,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45795 conditions, 8406 events. 4957/8406 cut-off events. For 253241/253241 co-relation queries the response was YES. Maximal size of possible extension queue 745. Compared 61584 event pairs, 2223 based on Foata normal form. 1/8230 useless extension candidates. Maximal degree in co-relation 45602. Up to 7180 conditions per place. [2025-01-10 01:11:51,646 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 342 selfloop transitions, 45 changer transitions 5/396 dead transitions. [2025-01-10 01:11:51,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 396 transitions, 5283 flow [2025-01-10 01:11:51,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:11:51,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:11:51,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 260 transitions. [2025-01-10 01:11:51,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2025-01-10 01:11:51,647 INFO L175 Difference]: Start difference. First operand has 354 places, 334 transitions, 4021 flow. Second operand 11 states and 260 transitions. [2025-01-10 01:11:51,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 396 transitions, 5283 flow [2025-01-10 01:11:52,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 396 transitions, 5116 flow, removed 49 selfloop flow, removed 7 redundant places. [2025-01-10 01:11:52,812 INFO L231 Difference]: Finished difference. Result has 359 places, 338 transitions, 4050 flow [2025-01-10 01:11:52,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3854, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4050, PETRI_PLACES=359, PETRI_TRANSITIONS=338} [2025-01-10 01:11:52,816 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 300 predicate places. [2025-01-10 01:11:52,816 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 338 transitions, 4050 flow [2025-01-10 01:11:52,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:52,816 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:52,816 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:52,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-01-10 01:11:52,816 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:11:52,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:52,817 INFO L85 PathProgramCache]: Analyzing trace with hash 609851895, now seen corresponding path program 41 times [2025-01-10 01:11:52,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:52,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515167921] [2025-01-10 01:11:52,817 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:11:52,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:52,826 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 3 equivalence classes. [2025-01-10 01:11:52,837 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:11:52,838 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:11:52,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:53,189 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:11:53,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:53,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515167921] [2025-01-10 01:11:53,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515167921] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:53,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:53,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:11:53,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220553134] [2025-01-10 01:11:53,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:53,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:11:53,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:53,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:11:53,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:11:53,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-10 01:11:53,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 338 transitions, 4050 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:53,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:53,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-10 01:11:53,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:54,563 INFO L124 PetriNetUnfolderBase]: 4759/8119 cut-off events. [2025-01-10 01:11:54,563 INFO L125 PetriNetUnfolderBase]: For 236753/236753 co-relation queries the response was YES. [2025-01-10 01:11:54,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43978 conditions, 8119 events. 4759/8119 cut-off events. For 236753/236753 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 59773 event pairs, 2217 based on Foata normal form. 1/7950 useless extension candidates. Maximal degree in co-relation 43782. Up to 7202 conditions per place. [2025-01-10 01:11:54,676 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 339 selfloop transitions, 34 changer transitions 3/381 dead transitions. [2025-01-10 01:11:54,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 381 transitions, 5156 flow [2025-01-10 01:11:54,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:11:54,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:11:54,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 246 transitions. [2025-01-10 01:11:54,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37272727272727274 [2025-01-10 01:11:54,677 INFO L175 Difference]: Start difference. First operand has 359 places, 338 transitions, 4050 flow. Second operand 11 states and 246 transitions. [2025-01-10 01:11:54,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 381 transitions, 5156 flow [2025-01-10 01:11:55,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 381 transitions, 4971 flow, removed 54 selfloop flow, removed 7 redundant places. [2025-01-10 01:11:55,368 INFO L231 Difference]: Finished difference. Result has 364 places, 340 transitions, 3959 flow [2025-01-10 01:11:55,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3865, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3959, PETRI_PLACES=364, PETRI_TRANSITIONS=340} [2025-01-10 01:11:55,369 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 305 predicate places. [2025-01-10 01:11:55,369 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 340 transitions, 3959 flow [2025-01-10 01:11:55,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:55,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:55,369 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:11:55,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-01-10 01:11:55,369 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:11:55,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:55,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1290131567, now seen corresponding path program 1 times [2025-01-10 01:11:55,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:55,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350381482] [2025-01-10 01:11:55,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:55,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:55,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 01:11:55,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 01:11:55,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:55,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:55,467 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:11:55,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:55,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350381482] [2025-01-10 01:11:55,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350381482] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:55,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088139433] [2025-01-10 01:11:55,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:11:55,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:55,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:55,470 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:11:55,473 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:11:55,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 01:11:55,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 01:11:55,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:55,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:55,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:11:55,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:55,636 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:11:55,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:55,720 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:11:55,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088139433] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:11:55,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:11:55,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-01-10 01:11:55,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254384819] [2025-01-10 01:11:55,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:11:55,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:11:55,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:55,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:11:55,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:11:55,749 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-01-10 01:11:55,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 340 transitions, 3959 flow. Second operand has 13 states, 13 states have (on average 17.846153846153847) internal successors, (232), 13 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:11:55,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:55,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-01-10 01:11:55,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:58,578 INFO L124 PetriNetUnfolderBase]: 7071/13179 cut-off events. [2025-01-10 01:11:58,579 INFO L125 PetriNetUnfolderBase]: For 494484/494615 co-relation queries the response was YES. [2025-01-10 01:11:58,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73677 conditions, 13179 events. 7071/13179 cut-off events. For 494484/494615 co-relation queries the response was YES. Maximal size of possible extension queue 1017. Compared 114314 event pairs, 2781 based on Foata normal form. 860/13658 useless extension candidates. Maximal degree in co-relation 73478. Up to 5925 conditions per place. [2025-01-10 01:11:58,790 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 497 selfloop transitions, 14 changer transitions 52/607 dead transitions. [2025-01-10 01:11:58,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 607 transitions, 8680 flow [2025-01-10 01:11:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:11:58,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:11:58,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 225 transitions. [2025-01-10 01:11:58,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-01-10 01:11:58,791 INFO L175 Difference]: Start difference. First operand has 364 places, 340 transitions, 3959 flow. Second operand 9 states and 225 transitions. [2025-01-10 01:11:58,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 607 transitions, 8680 flow [2025-01-10 01:12:00,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 607 transitions, 8503 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-10 01:12:00,075 INFO L231 Difference]: Finished difference. Result has 368 places, 345 transitions, 4151 flow [2025-01-10 01:12:00,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3895, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4151, PETRI_PLACES=368, PETRI_TRANSITIONS=345} [2025-01-10 01:12:00,075 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 309 predicate places. [2025-01-10 01:12:00,075 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 345 transitions, 4151 flow [2025-01-10 01:12:00,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.846153846153847) internal successors, (232), 13 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:00,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:00,076 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:00,087 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:12:00,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2025-01-10 01:12:00,280 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-01-10 01:12:00,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:00,282 INFO L85 PathProgramCache]: Analyzing trace with hash 2072419209, now seen corresponding path program 1 times [2025-01-10 01:12:00,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:00,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94960752] [2025-01-10 01:12:00,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:00,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:00,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 01:12:00,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 01:12:00,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:00,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:00,383 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:12:00,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:00,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94960752] [2025-01-10 01:12:00,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94960752] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:00,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462662899] [2025-01-10 01:12:00,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:00,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:00,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:00,388 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:12:00,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:12:00,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 01:12:00,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 01:12:00,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:00,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:00,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:12:00,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:00,595 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:12:00,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:00,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:12:00,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462662899] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:12:00,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:12:00,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 01:12:00,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126461527] [2025-01-10 01:12:00,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:12:00,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:12:00,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:00,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:12:00,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:12:00,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-01-10 01:12:00,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 345 transitions, 4151 flow. Second operand has 12 states, 12 states have (on average 19.0) internal successors, (228), 12 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:00,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:00,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-01-10 01:12:00,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand