./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-mult-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-mult-4.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 b81cf2d80bc77dedaac253250be737ceaa09f6e691f026864fe6fd5cb48c2489 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:15:07,611 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:15:07,661 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:15:07,665 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:15:07,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:15:07,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:15:07,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:15:07,684 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:15:07,684 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:15:07,684 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:15:07,684 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:15:07,685 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:15:07,685 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:15:07,685 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:15:07,685 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:15:07,685 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:15:07,686 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:15:07,686 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:15:07,686 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:15:07,686 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:15:07,686 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:15:07,686 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:15:07,686 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:15:07,686 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:15:07,686 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:15:07,686 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:15:07,686 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:15:07,687 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:15:07,687 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:15:07,687 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:15:07,687 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:15:07,687 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:15:07,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:15:07,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:15:07,688 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:15:07,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:15:07,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:15:07,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:15:07,688 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:15:07,688 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:15:07,688 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:15:07,688 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:15:07,688 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/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 -> b81cf2d80bc77dedaac253250be737ceaa09f6e691f026864fe6fd5cb48c2489 [2025-03-04 10:15:07,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:15:07,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:15:07,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:15:07,928 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:15:07,929 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:15:07,929 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-mult-4.wvr.c [2025-03-04 10:15:09,022 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fc806c65/72f53643b185474e9e1e8b2ba103e9ae/FLAG860175613 [2025-03-04 10:15:09,222 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:15:09,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-mult-4.wvr.c [2025-03-04 10:15:09,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fc806c65/72f53643b185474e9e1e8b2ba103e9ae/FLAG860175613 [2025-03-04 10:15:09,253 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fc806c65/72f53643b185474e9e1e8b2ba103e9ae [2025-03-04 10:15:09,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:15:09,256 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:15:09,256 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:15:09,256 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:15:09,259 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:15:09,259 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:15:09" (1/1) ... [2025-03-04 10:15:09,260 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7488c963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:09, skipping insertion in model container [2025-03-04 10:15:09,260 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:15:09" (1/1) ... [2025-03-04 10:15:09,270 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:15:09,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:15:09,414 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:15:09,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:15:09,449 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:15:09,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:09 WrapperNode [2025-03-04 10:15:09,450 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:15:09,451 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:15:09,451 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:15:09,451 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:15:09,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:09" (1/1) ... [2025-03-04 10:15:09,462 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:09" (1/1) ... [2025-03-04 10:15:09,479 INFO L138 Inliner]: procedures = 22, calls = 23, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 94 [2025-03-04 10:15:09,481 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:15:09,481 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:15:09,481 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:15:09,482 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:15:09,487 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:09" (1/1) ... [2025-03-04 10:15:09,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:09" (1/1) ... [2025-03-04 10:15:09,489 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:09" (1/1) ... [2025-03-04 10:15:09,504 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 10:15:09,504 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:09" (1/1) ... [2025-03-04 10:15:09,504 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:09" (1/1) ... [2025-03-04 10:15:09,512 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:09" (1/1) ... [2025-03-04 10:15:09,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:09" (1/1) ... [2025-03-04 10:15:09,513 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:09" (1/1) ... [2025-03-04 10:15:09,514 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:09" (1/1) ... [2025-03-04 10:15:09,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:15:09,516 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:15:09,516 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:15:09,516 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:15:09,516 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:09" (1/1) ... [2025-03-04 10:15:09,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:15:09,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:09,547 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:15:09,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:15:09,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:15:09,569 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:15:09,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:15:09,569 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:15:09,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:15:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:15:09,570 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:15:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-04 10:15:09,570 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-04 10:15:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:15:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 10:15:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 10:15:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:15:09,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:15:09,571 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:15:09,649 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:15:09,650 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:15:09,800 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:15:09,801 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:15:09,894 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:15:09,894 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:15:09,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:15:09 BoogieIcfgContainer [2025-03-04 10:15:09,895 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:15:09,896 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:15:09,896 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:15:09,900 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:15:09,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:15:09" (1/3) ... [2025-03-04 10:15:09,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29fa9811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:15:09, skipping insertion in model container [2025-03-04 10:15:09,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:09" (2/3) ... [2025-03-04 10:15:09,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29fa9811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:15:09, skipping insertion in model container [2025-03-04 10:15:09,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:15:09" (3/3) ... [2025-03-04 10:15:09,901 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-mult-4.wvr.c [2025-03-04 10:15:09,911 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:15:09,913 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-mult-4.wvr.c that has 5 procedures, 39 locations, 1 initial locations, 4 loop locations, and 2 error locations. [2025-03-04 10:15:09,913 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:15:09,967 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 10:15:09,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 112 flow [2025-03-04 10:15:10,015 INFO L124 PetriNetUnfolderBase]: 4/38 cut-off events. [2025-03-04 10:15:10,017 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:15:10,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 38 events. 4/38 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-03-04 10:15:10,020 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 42 transitions, 112 flow [2025-03-04 10:15:10,022 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 98 flow [2025-03-04 10:15:10,032 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:15:10,042 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;@74b3be9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:15:10,044 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 10:15:10,058 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:15:10,058 INFO L124 PetriNetUnfolderBase]: 4/34 cut-off events. [2025-03-04 10:15:10,058 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:15:10,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:10,059 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:10,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:15:10,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:10,067 INFO L85 PathProgramCache]: Analyzing trace with hash -161517360, now seen corresponding path program 1 times [2025-03-04 10:15:10,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:10,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430000057] [2025-03-04 10:15:10,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:10,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:10,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:15:10,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:15:10,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:10,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:10,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:10,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:10,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430000057] [2025-03-04 10:15:10,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430000057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:10,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:10,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:15:10,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921552891] [2025-03-04 10:15:10,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:10,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:15:10,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:10,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:15:10,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:15:10,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2025-03-04 10:15:10,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 98 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-03-04 10:15:10,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:10,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2025-03-04 10:15:10,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:10,881 INFO L124 PetriNetUnfolderBase]: 3042/4231 cut-off events. [2025-03-04 10:15:10,881 INFO L125 PetriNetUnfolderBase]: For 343/343 co-relation queries the response was YES. [2025-03-04 10:15:10,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8631 conditions, 4231 events. 3042/4231 cut-off events. For 343/343 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 18767 event pairs, 763 based on Foata normal form. 153/4374 useless extension candidates. Maximal degree in co-relation 7625. Up to 3203 conditions per place. [2025-03-04 10:15:10,909 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 46 selfloop transitions, 3 changer transitions 2/56 dead transitions. [2025-03-04 10:15:10,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 259 flow [2025-03-04 10:15:10,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:15:10,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:15:10,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2025-03-04 10:15:10,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6746031746031746 [2025-03-04 10:15:10,922 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 98 flow. Second operand 3 states and 85 transitions. [2025-03-04 10:15:10,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 259 flow [2025-03-04 10:15:10,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 56 transitions, 229 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 10:15:10,933 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 101 flow [2025-03-04 10:15:10,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2025-03-04 10:15:10,939 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -7 predicate places. [2025-03-04 10:15:10,939 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 101 flow [2025-03-04 10:15:10,940 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-03-04 10:15:10,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:10,940 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] [2025-03-04 10:15:10,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:15:10,940 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:15:10,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:10,941 INFO L85 PathProgramCache]: Analyzing trace with hash 271092807, now seen corresponding path program 1 times [2025-03-04 10:15:10,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:10,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062332639] [2025-03-04 10:15:10,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:10,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:10,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:15:10,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:15:10,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:10,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:11,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:11,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:11,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062332639] [2025-03-04 10:15:11,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062332639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:11,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:11,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:15:11,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778454816] [2025-03-04 10:15:11,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:11,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:15:11,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:11,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:15:11,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:15:11,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2025-03-04 10:15:11,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:11,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:11,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2025-03-04 10:15:11,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:12,061 INFO L124 PetriNetUnfolderBase]: 13495/17583 cut-off events. [2025-03-04 10:15:12,063 INFO L125 PetriNetUnfolderBase]: For 1786/1786 co-relation queries the response was YES. [2025-03-04 10:15:12,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39169 conditions, 17583 events. 13495/17583 cut-off events. For 1786/1786 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 83188 event pairs, 4626 based on Foata normal form. 0/14230 useless extension candidates. Maximal degree in co-relation 7257. Up to 9386 conditions per place. [2025-03-04 10:15:12,135 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 96 selfloop transitions, 10 changer transitions 0/107 dead transitions. [2025-03-04 10:15:12,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 107 transitions, 497 flow [2025-03-04 10:15:12,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:15:12,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:15:12,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2025-03-04 10:15:12,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-03-04 10:15:12,139 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 101 flow. Second operand 5 states and 132 transitions. [2025-03-04 10:15:12,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 107 transitions, 497 flow [2025-03-04 10:15:12,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 107 transitions, 489 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:15:12,143 INFO L231 Difference]: Finished difference. Result has 45 places, 46 transitions, 165 flow [2025-03-04 10:15:12,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=165, PETRI_PLACES=45, PETRI_TRANSITIONS=46} [2025-03-04 10:15:12,144 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2025-03-04 10:15:12,144 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 46 transitions, 165 flow [2025-03-04 10:15:12,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:12,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:12,145 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:12,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:15:12,145 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:15:12,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:12,145 INFO L85 PathProgramCache]: Analyzing trace with hash -897201155, now seen corresponding path program 2 times [2025-03-04 10:15:12,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:12,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008452719] [2025-03-04 10:15:12,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:15:12,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:12,156 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:15:12,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:15:12,168 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:15:12,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:12,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:12,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:12,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008452719] [2025-03-04 10:15:12,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008452719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:12,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:12,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:15:12,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874911323] [2025-03-04 10:15:12,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:12,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:15:12,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:12,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:15:12,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:15:12,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2025-03-04 10:15:12,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 46 transitions, 165 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:12,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:12,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2025-03-04 10:15:12,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:13,435 INFO L124 PetriNetUnfolderBase]: 20850/27089 cut-off events. [2025-03-04 10:15:13,435 INFO L125 PetriNetUnfolderBase]: For 12295/12295 co-relation queries the response was YES. [2025-03-04 10:15:13,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72903 conditions, 27089 events. 20850/27089 cut-off events. For 12295/12295 co-relation queries the response was YES. Maximal size of possible extension queue 885. Compared 133690 event pairs, 3494 based on Foata normal form. 760/27849 useless extension candidates. Maximal degree in co-relation 42442. Up to 16632 conditions per place. [2025-03-04 10:15:13,544 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 93 selfloop transitions, 8 changer transitions 2/104 dead transitions. [2025-03-04 10:15:13,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 104 transitions, 570 flow [2025-03-04 10:15:13,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:15:13,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:15:13,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-03-04 10:15:13,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2025-03-04 10:15:13,545 INFO L175 Difference]: Start difference. First operand has 45 places, 46 transitions, 165 flow. Second operand 4 states and 106 transitions. [2025-03-04 10:15:13,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 104 transitions, 570 flow [2025-03-04 10:15:13,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 104 transitions, 570 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 10:15:13,552 INFO L231 Difference]: Finished difference. Result has 51 places, 54 transitions, 251 flow [2025-03-04 10:15:13,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=251, PETRI_PLACES=51, PETRI_TRANSITIONS=54} [2025-03-04 10:15:13,552 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 5 predicate places. [2025-03-04 10:15:13,553 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 54 transitions, 251 flow [2025-03-04 10:15:13,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:13,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:13,553 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] [2025-03-04 10:15:13,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:15:13,553 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:15:13,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:13,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1429514405, now seen corresponding path program 3 times [2025-03-04 10:15:13,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:13,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690713255] [2025-03-04 10:15:13,555 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:15:13,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:13,563 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:15:13,578 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:15:13,580 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:15:13,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:13,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:13,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:13,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690713255] [2025-03-04 10:15:13,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690713255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:13,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:13,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:15:13,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421783835] [2025-03-04 10:15:13,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:13,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:15:13,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:13,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:15:13,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:15:13,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2025-03-04 10:15:13,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 54 transitions, 251 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:13,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:13,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2025-03-04 10:15:13,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:14,980 INFO L124 PetriNetUnfolderBase]: 27113/35301 cut-off events. [2025-03-04 10:15:14,981 INFO L125 PetriNetUnfolderBase]: For 34240/34240 co-relation queries the response was YES. [2025-03-04 10:15:15,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106392 conditions, 35301 events. 27113/35301 cut-off events. For 34240/34240 co-relation queries the response was YES. Maximal size of possible extension queue 1033. Compared 177868 event pairs, 7966 based on Foata normal form. 432/35733 useless extension candidates. Maximal degree in co-relation 39884. Up to 19571 conditions per place. [2025-03-04 10:15:15,160 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 101 selfloop transitions, 10 changer transitions 0/112 dead transitions. [2025-03-04 10:15:15,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 112 transitions, 688 flow [2025-03-04 10:15:15,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:15:15,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:15:15,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-03-04 10:15:15,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-03-04 10:15:15,164 INFO L175 Difference]: Start difference. First operand has 51 places, 54 transitions, 251 flow. Second operand 4 states and 108 transitions. [2025-03-04 10:15:15,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 112 transitions, 688 flow [2025-03-04 10:15:15,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 112 transitions, 688 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 10:15:15,181 INFO L231 Difference]: Finished difference. Result has 56 places, 56 transitions, 311 flow [2025-03-04 10:15:15,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=311, PETRI_PLACES=56, PETRI_TRANSITIONS=56} [2025-03-04 10:15:15,182 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 10 predicate places. [2025-03-04 10:15:15,183 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 56 transitions, 311 flow [2025-03-04 10:15:15,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:15,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:15,183 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] [2025-03-04 10:15:15,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:15:15,183 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:15:15,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:15,184 INFO L85 PathProgramCache]: Analyzing trace with hash 334284347, now seen corresponding path program 1 times [2025-03-04 10:15:15,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:15,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860454982] [2025-03-04 10:15:15,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:15,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:15,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:15:15,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:15:15,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:15,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:15,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:15,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:15,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860454982] [2025-03-04 10:15:15,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860454982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:15,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:15,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:15:15,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909167376] [2025-03-04 10:15:15,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:15,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:15:15,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:15,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:15:15,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:15:15,297 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2025-03-04 10:15:15,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 56 transitions, 311 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:15,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:15,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2025-03-04 10:15:15,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:17,006 INFO L124 PetriNetUnfolderBase]: 28674/37800 cut-off events. [2025-03-04 10:15:17,006 INFO L125 PetriNetUnfolderBase]: For 69371/69371 co-relation queries the response was YES. [2025-03-04 10:15:17,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123754 conditions, 37800 events. 28674/37800 cut-off events. For 69371/69371 co-relation queries the response was YES. Maximal size of possible extension queue 1143. Compared 202784 event pairs, 8683 based on Foata normal form. 778/38578 useless extension candidates. Maximal degree in co-relation 52637. Up to 17888 conditions per place. [2025-03-04 10:15:17,165 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 100 selfloop transitions, 7 changer transitions 18/126 dead transitions. [2025-03-04 10:15:17,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 126 transitions, 886 flow [2025-03-04 10:15:17,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:15:17,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:15:17,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-03-04 10:15:17,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-03-04 10:15:17,167 INFO L175 Difference]: Start difference. First operand has 56 places, 56 transitions, 311 flow. Second operand 5 states and 130 transitions. [2025-03-04 10:15:17,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 126 transitions, 886 flow [2025-03-04 10:15:17,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 126 transitions, 821 flow, removed 23 selfloop flow, removed 2 redundant places. [2025-03-04 10:15:17,202 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 325 flow [2025-03-04 10:15:17,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=325, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2025-03-04 10:15:17,203 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 14 predicate places. [2025-03-04 10:15:17,203 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 325 flow [2025-03-04 10:15:17,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:17,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:17,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] [2025-03-04 10:15:17,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:15:17,204 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:15:17,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:17,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1400062229, now seen corresponding path program 2 times [2025-03-04 10:15:17,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:17,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217622820] [2025-03-04 10:15:17,207 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:15:17,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:17,214 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:15:17,226 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:15:17,226 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:15:17,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:17,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:17,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:17,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217622820] [2025-03-04 10:15:17,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217622820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:17,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:17,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:15:17,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655495898] [2025-03-04 10:15:17,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:17,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:15:17,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:17,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:15:17,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:15:17,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2025-03-04 10:15:17,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 325 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:17,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:17,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2025-03-04 10:15:17,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:19,628 INFO L124 PetriNetUnfolderBase]: 37844/49557 cut-off events. [2025-03-04 10:15:19,628 INFO L125 PetriNetUnfolderBase]: For 102395/102395 co-relation queries the response was YES. [2025-03-04 10:15:19,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174254 conditions, 49557 events. 37844/49557 cut-off events. For 102395/102395 co-relation queries the response was YES. Maximal size of possible extension queue 1524. Compared 264183 event pairs, 10706 based on Foata normal form. 965/50522 useless extension candidates. Maximal degree in co-relation 65094. Up to 21361 conditions per place. [2025-03-04 10:15:19,829 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 114 selfloop transitions, 31 changer transitions 2/148 dead transitions. [2025-03-04 10:15:19,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 148 transitions, 1149 flow [2025-03-04 10:15:19,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:15:19,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:15:19,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-03-04 10:15:19,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6238095238095238 [2025-03-04 10:15:19,830 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 325 flow. Second operand 5 states and 131 transitions. [2025-03-04 10:15:19,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 148 transitions, 1149 flow [2025-03-04 10:15:19,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 148 transitions, 1117 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:15:19,912 INFO L231 Difference]: Finished difference. Result has 64 places, 77 transitions, 629 flow [2025-03-04 10:15:19,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=629, PETRI_PLACES=64, PETRI_TRANSITIONS=77} [2025-03-04 10:15:19,913 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 18 predicate places. [2025-03-04 10:15:19,913 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 77 transitions, 629 flow [2025-03-04 10:15:19,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:19,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:19,915 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] [2025-03-04 10:15:19,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:15:19,916 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:15:19,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:19,916 INFO L85 PathProgramCache]: Analyzing trace with hash 2049507927, now seen corresponding path program 3 times [2025-03-04 10:15:19,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:19,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720667370] [2025-03-04 10:15:19,916 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:15:19,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:19,921 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:15:19,926 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:15:19,926 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:15:19,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:19,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:19,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:19,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720667370] [2025-03-04 10:15:19,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720667370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:19,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:19,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:15:19,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324293567] [2025-03-04 10:15:19,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:19,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:15:20,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:20,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:15:20,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:15:20,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2025-03-04 10:15:20,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 77 transitions, 629 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:20,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:20,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2025-03-04 10:15:20,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:22,934 INFO L124 PetriNetUnfolderBase]: 49386/64469 cut-off events. [2025-03-04 10:15:22,934 INFO L125 PetriNetUnfolderBase]: For 201210/201210 co-relation queries the response was YES. [2025-03-04 10:15:23,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256034 conditions, 64469 events. 49386/64469 cut-off events. For 201210/201210 co-relation queries the response was YES. Maximal size of possible extension queue 1832. Compared 343921 event pairs, 18703 based on Foata normal form. 965/65434 useless extension candidates. Maximal degree in co-relation 119194. Up to 37650 conditions per place. [2025-03-04 10:15:23,302 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 141 selfloop transitions, 25 changer transitions 5/172 dead transitions. [2025-03-04 10:15:23,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 172 transitions, 1569 flow [2025-03-04 10:15:23,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:15:23,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:15:23,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-03-04 10:15:23,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-03-04 10:15:23,303 INFO L175 Difference]: Start difference. First operand has 64 places, 77 transitions, 629 flow. Second operand 5 states and 130 transitions. [2025-03-04 10:15:23,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 172 transitions, 1569 flow [2025-03-04 10:15:24,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 172 transitions, 1439 flow, removed 35 selfloop flow, removed 3 redundant places. [2025-03-04 10:15:24,040 INFO L231 Difference]: Finished difference. Result has 68 places, 98 transitions, 876 flow [2025-03-04 10:15:24,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=876, PETRI_PLACES=68, PETRI_TRANSITIONS=98} [2025-03-04 10:15:24,040 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 22 predicate places. [2025-03-04 10:15:24,041 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 98 transitions, 876 flow [2025-03-04 10:15:24,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:24,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:24,041 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] [2025-03-04 10:15:24,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:15:24,041 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:15:24,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:24,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1584342727, now seen corresponding path program 4 times [2025-03-04 10:15:24,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:24,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171577173] [2025-03-04 10:15:24,042 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:15:24,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:24,051 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:15:24,062 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:15:24,063 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:15:24,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:24,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:24,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:24,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171577173] [2025-03-04 10:15:24,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171577173] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:24,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175432280] [2025-03-04 10:15:24,239 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:15:24,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:24,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:24,242 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:15:24,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:15:24,288 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:15:24,305 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:15:24,305 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:15:24,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:24,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:15:24,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:24,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:24,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:24,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:24,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175432280] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:24,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:24,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2025-03-04 10:15:24,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955363922] [2025-03-04 10:15:24,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:24,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:15:24,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:24,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:15:24,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:15:24,451 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2025-03-04 10:15:24,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 98 transitions, 876 flow. Second operand has 13 states, 13 states have (on average 10.0) internal successors, (130), 13 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:24,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:24,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2025-03-04 10:15:24,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:31,289 INFO L124 PetriNetUnfolderBase]: 75608/97681 cut-off events. [2025-03-04 10:15:31,290 INFO L125 PetriNetUnfolderBase]: For 336498/336498 co-relation queries the response was YES. [2025-03-04 10:15:31,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399914 conditions, 97681 events. 75608/97681 cut-off events. For 336498/336498 co-relation queries the response was YES. Maximal size of possible extension queue 2548. Compared 528293 event pairs, 3522 based on Foata normal form. 3433/101114 useless extension candidates. Maximal degree in co-relation 205592. Up to 25345 conditions per place. [2025-03-04 10:15:32,030 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 529 selfloop transitions, 196 changer transitions 11/737 dead transitions. [2025-03-04 10:15:32,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 737 transitions, 6067 flow [2025-03-04 10:15:32,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 10:15:32,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-04 10:15:32,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 761 transitions. [2025-03-04 10:15:32,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5844854070660522 [2025-03-04 10:15:32,032 INFO L175 Difference]: Start difference. First operand has 68 places, 98 transitions, 876 flow. Second operand 31 states and 761 transitions. [2025-03-04 10:15:32,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 737 transitions, 6067 flow [2025-03-04 10:15:33,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 737 transitions, 5805 flow, removed 131 selfloop flow, removed 0 redundant places. [2025-03-04 10:15:33,259 INFO L231 Difference]: Finished difference. Result has 121 places, 256 transitions, 2866 flow [2025-03-04 10:15:33,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=2866, PETRI_PLACES=121, PETRI_TRANSITIONS=256} [2025-03-04 10:15:33,260 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 75 predicate places. [2025-03-04 10:15:33,262 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 256 transitions, 2866 flow [2025-03-04 10:15:33,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.0) internal successors, (130), 13 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:33,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:33,262 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:33,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:15:33,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:33,467 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:15:33,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:33,467 INFO L85 PathProgramCache]: Analyzing trace with hash 718964767, now seen corresponding path program 1 times [2025-03-04 10:15:33,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:33,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504492426] [2025-03-04 10:15:33,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:33,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:33,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:15:33,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:15:33,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:33,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:33,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:15:33,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:33,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504492426] [2025-03-04 10:15:33,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504492426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:33,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:33,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:15:33,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279609277] [2025-03-04 10:15:33,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:33,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:15:33,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:33,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:15:33,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:15:33,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2025-03-04 10:15:33,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 256 transitions, 2866 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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-03-04 10:15:33,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:33,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2025-03-04 10:15:33,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:42,861 INFO L124 PetriNetUnfolderBase]: 92317/119204 cut-off events. [2025-03-04 10:15:42,861 INFO L125 PetriNetUnfolderBase]: For 1558738/1558738 co-relation queries the response was YES. [2025-03-04 10:15:43,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690177 conditions, 119204 events. 92317/119204 cut-off events. For 1558738/1558738 co-relation queries the response was YES. Maximal size of possible extension queue 3174. Compared 662898 event pairs, 19878 based on Foata normal form. 1814/121018 useless extension candidates. Maximal degree in co-relation 626798. Up to 53560 conditions per place. [2025-03-04 10:15:44,021 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 394 selfloop transitions, 122 changer transitions 5/522 dead transitions. [2025-03-04 10:15:44,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 522 transitions, 6542 flow [2025-03-04 10:15:44,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:15:44,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:15:44,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2025-03-04 10:15:44,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6122448979591837 [2025-03-04 10:15:44,022 INFO L175 Difference]: Start difference. First operand has 121 places, 256 transitions, 2866 flow. Second operand 7 states and 180 transitions. [2025-03-04 10:15:44,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 522 transitions, 6542 flow [2025-03-04 10:16:01,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 522 transitions, 5783 flow, removed 181 selfloop flow, removed 8 redundant places. [2025-03-04 10:16:01,211 INFO L231 Difference]: Finished difference. Result has 121 places, 298 transitions, 3434 flow [2025-03-04 10:16:01,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2433, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3434, PETRI_PLACES=121, PETRI_TRANSITIONS=298} [2025-03-04 10:16:01,212 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 75 predicate places. [2025-03-04 10:16:01,212 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 298 transitions, 3434 flow [2025-03-04 10:16:01,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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-03-04 10:16:01,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:01,212 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] [2025-03-04 10:16:01,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:16:01,213 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:16:01,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:01,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1761442263, now seen corresponding path program 1 times [2025-03-04 10:16:01,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:01,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986177159] [2025-03-04 10:16:01,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:01,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:01,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:16:01,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:16:01,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:01,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:01,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:16:01,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:01,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986177159] [2025-03-04 10:16:01,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986177159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:16:01,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:16:01,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:16:01,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674983212] [2025-03-04 10:16:01,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:16:01,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:16:01,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:01,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:16:01,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:16:01,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2025-03-04 10:16:01,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 298 transitions, 3434 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:16:01,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:01,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2025-03-04 10:16:01,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand