./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix039.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix039.oepc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 42c5ff0d69642601057eb29fc7d78b67af5ab0b43644460199f4561abe049d3b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:45:38,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:45:38,252 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:45:38,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:45:38,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:45:38,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:45:38,276 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:45:38,276 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:45:38,277 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:45:38,277 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:45:38,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:45:38,277 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:45:38,277 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:45:38,277 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:45:38,277 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:45:38,278 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:45:38,278 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:45:38,278 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:45:38,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:45:38,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:45:38,278 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:45:38,281 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:45:38,281 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:45:38,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:45:38,282 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:45:38,282 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:45:38,282 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:45:38,282 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:45:38,282 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:45:38,282 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:45:38,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:45:38,282 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:45:38,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:45:38,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:45:38,282 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:45:38,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:45:38,282 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:45:38,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:45:38,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:45:38,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:45:38,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:45:38,282 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:45:38,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:45:38,282 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:45:38,282 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:45:38,282 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:45:38,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:45:38,283 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 42c5ff0d69642601057eb29fc7d78b67af5ab0b43644460199f4561abe049d3b [2025-01-10 00:45:38,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:45:38,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:45:38,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:45:38,518 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:45:38,518 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:45:38,519 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix039.oepc.i [2025-01-10 00:45:39,642 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb5463c51/9d7899940add44e6baf678b625424f86/FLAGb3783a664 [2025-01-10 00:45:39,930 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:45:39,931 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix039.oepc.i [2025-01-10 00:45:39,945 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb5463c51/9d7899940add44e6baf678b625424f86/FLAGb3783a664 [2025-01-10 00:45:40,206 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb5463c51/9d7899940add44e6baf678b625424f86 [2025-01-10 00:45:40,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:45:40,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:45:40,211 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:45:40,211 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:45:40,214 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:45:40,217 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:45:40" (1/1) ... [2025-01-10 00:45:40,218 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ca826b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:45:40, skipping insertion in model container [2025-01-10 00:45:40,218 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:45:40" (1/1) ... [2025-01-10 00:45:40,250 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:45:40,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:45:40,545 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:45:40,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:45:40,638 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:45:40,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:45:40 WrapperNode [2025-01-10 00:45:40,640 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:45:40,641 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:45:40,641 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:45:40,641 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:45:40,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:45:40" (1/1) ... [2025-01-10 00:45:40,659 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:45:40" (1/1) ... [2025-01-10 00:45:40,680 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 133 [2025-01-10 00:45:40,680 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:45:40,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:45:40,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:45:40,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:45:40,688 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:45:40" (1/1) ... [2025-01-10 00:45:40,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:45:40" (1/1) ... [2025-01-10 00:45:40,691 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:45:40" (1/1) ... [2025-01-10 00:45:40,706 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-01-10 00:45:40,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:45:40" (1/1) ... [2025-01-10 00:45:40,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:45:40" (1/1) ... [2025-01-10 00:45:40,716 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:45:40" (1/1) ... [2025-01-10 00:45:40,717 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:45:40" (1/1) ... [2025-01-10 00:45:40,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:45:40" (1/1) ... [2025-01-10 00:45:40,721 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:45:40" (1/1) ... [2025-01-10 00:45:40,722 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:45:40" (1/1) ... [2025-01-10 00:45:40,731 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:45:40,731 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:45:40,731 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:45:40,731 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:45:40,732 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:45:40" (1/1) ... [2025-01-10 00:45:40,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:45:40,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:45:40,756 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:45:40,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:45:40,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:45:40,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:45:40,775 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-10 00:45:40,775 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-10 00:45:40,775 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-10 00:45:40,775 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-10 00:45:40,775 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-10 00:45:40,775 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-10 00:45:40,776 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-01-10 00:45:40,776 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-01-10 00:45:40,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:45:40,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:45:40,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:45:40,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:45:40,777 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:45:40,866 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:45:40,868 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:45:41,145 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:45:41,145 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:45:41,299 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:45:41,299 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:45:41,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:45:41 BoogieIcfgContainer [2025-01-10 00:45:41,300 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:45:41,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:45:41,303 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:45:41,307 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:45:41,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:45:40" (1/3) ... [2025-01-10 00:45:41,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e44bff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:45:41, skipping insertion in model container [2025-01-10 00:45:41,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:45:40" (2/3) ... [2025-01-10 00:45:41,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e44bff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:45:41, skipping insertion in model container [2025-01-10 00:45:41,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:45:41" (3/3) ... [2025-01-10 00:45:41,311 INFO L128 eAbstractionObserver]: Analyzing ICFG mix039.oepc.i [2025-01-10 00:45:41,323 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:45:41,326 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix039.oepc.i that has 5 procedures, 54 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-01-10 00:45:41,326 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:45:41,380 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:45:41,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2025-01-10 00:45:41,436 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2025-01-10 00:45:41,439 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:45:41,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 107 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2025-01-10 00:45:41,442 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2025-01-10 00:45:41,445 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2025-01-10 00:45:41,452 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:45:41,460 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;@1f2b3c0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:45:41,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 00:45:41,464 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:45:41,464 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-01-10 00:45:41,465 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:45:41,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:45:41,465 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:45:41,466 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:45:41,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:45:41,470 INFO L85 PathProgramCache]: Analyzing trace with hash 13010806, now seen corresponding path program 1 times [2025-01-10 00:45:41,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:45:41,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171029179] [2025-01-10 00:45:41,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:45:41,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:45:41,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:45:41,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:45:41,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:45:41,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:45:41,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:45:41,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:45:41,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171029179] [2025-01-10 00:45:41,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171029179] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:45:41,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:45:41,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:45:41,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323726252] [2025-01-10 00:45:41,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:45:41,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:45:41,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:45:41,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:45:41,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:45:41,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2025-01-10 00:45:41,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:45:41,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:45:41,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2025-01-10 00:45:41,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:45:42,688 INFO L124 PetriNetUnfolderBase]: 3311/5215 cut-off events. [2025-01-10 00:45:42,688 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-01-10 00:45:42,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9895 conditions, 5215 events. 3311/5215 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 33468 event pairs, 2177 based on Foata normal form. 288/5439 useless extension candidates. Maximal degree in co-relation 9883. Up to 3661 conditions per place. [2025-01-10 00:45:42,727 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 41 selfloop transitions, 2 changer transitions 2/67 dead transitions. [2025-01-10 00:45:42,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 67 transitions, 245 flow [2025-01-10 00:45:42,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:45:42,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:45:42,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2025-01-10 00:45:42,739 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7757575757575758 [2025-01-10 00:45:42,740 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 128 transitions. [2025-01-10 00:45:42,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 67 transitions, 245 flow [2025-01-10 00:45:42,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 67 transitions, 238 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:45:42,750 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2025-01-10 00:45:42,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2025-01-10 00:45:42,755 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2025-01-10 00:45:42,756 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2025-01-10 00:45:42,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:45:42,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:45:42,757 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:45:42,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:45:42,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:45:42,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:45:42,759 INFO L85 PathProgramCache]: Analyzing trace with hash -947079504, now seen corresponding path program 1 times [2025-01-10 00:45:42,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:45:42,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214951599] [2025-01-10 00:45:42,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:45:42,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:45:42,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:45:42,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:45:42,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:45:42,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:45:42,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:45:42,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:45:42,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214951599] [2025-01-10 00:45:42,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214951599] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:45:42,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:45:42,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:45:42,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979723714] [2025-01-10 00:45:42,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:45:42,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:45:42,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:45:42,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:45:42,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:45:42,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2025-01-10 00:45:42,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:45:42,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:45:42,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2025-01-10 00:45:42,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:45:43,347 INFO L124 PetriNetUnfolderBase]: 2903/4947 cut-off events. [2025-01-10 00:45:43,347 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES. [2025-01-10 00:45:43,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9351 conditions, 4947 events. 2903/4947 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 35212 event pairs, 2903 based on Foata normal form. 144/4849 useless extension candidates. Maximal degree in co-relation 9341. Up to 4016 conditions per place. [2025-01-10 00:45:43,374 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 22 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2025-01-10 00:45:43,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 150 flow [2025-01-10 00:45:43,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:45:43,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:45:43,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2025-01-10 00:45:43,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-01-10 00:45:43,376 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 100 transitions. [2025-01-10 00:45:43,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 150 flow [2025-01-10 00:45:43,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:45:43,377 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2025-01-10 00:45:43,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2025-01-10 00:45:43,378 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2025-01-10 00:45:43,378 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2025-01-10 00:45:43,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:45:43,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:45:43,378 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:45:43,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:45:43,378 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:45:43,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:45:43,380 INFO L85 PathProgramCache]: Analyzing trace with hash -947078218, now seen corresponding path program 1 times [2025-01-10 00:45:43,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:45:43,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675713440] [2025-01-10 00:45:43,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:45:43,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:45:43,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:45:43,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:45:43,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:45:43,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:45:43,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:45:43,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:45:43,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675713440] [2025-01-10 00:45:43,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675713440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:45:43,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:45:43,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:45:43,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968636131] [2025-01-10 00:45:43,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:45:43,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:45:43,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:45:43,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:45:43,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:45:43,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 55 [2025-01-10 00:45:43,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:45:43,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:45:43,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 55 [2025-01-10 00:45:43,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:45:46,978 INFO L124 PetriNetUnfolderBase]: 28756/41839 cut-off events. [2025-01-10 00:45:46,979 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:45:47,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80941 conditions, 41839 events. 28756/41839 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1903. Compared 304050 event pairs, 7300 based on Foata normal form. 0/40652 useless extension candidates. Maximal degree in co-relation 80935. Up to 16239 conditions per place. [2025-01-10 00:45:47,157 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 48 selfloop transitions, 7 changer transitions 96/165 dead transitions. [2025-01-10 00:45:47,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 165 transitions, 648 flow [2025-01-10 00:45:47,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:45:47,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:45:47,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 324 transitions. [2025-01-10 00:45:47,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6545454545454545 [2025-01-10 00:45:47,160 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 98 flow. Second operand 9 states and 324 transitions. [2025-01-10 00:45:47,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 165 transitions, 648 flow [2025-01-10 00:45:47,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 165 transitions, 647 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:45:47,166 INFO L231 Difference]: Finished difference. Result has 70 places, 49 transitions, 193 flow [2025-01-10 00:45:47,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=193, PETRI_PLACES=70, PETRI_TRANSITIONS=49} [2025-01-10 00:45:47,167 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2025-01-10 00:45:47,167 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 49 transitions, 193 flow [2025-01-10 00:45:47,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:45:47,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:45:47,168 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:45:47,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:45:47,168 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:45:47,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:45:47,169 INFO L85 PathProgramCache]: Analyzing trace with hash -595831147, now seen corresponding path program 1 times [2025-01-10 00:45:47,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:45:47,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987255123] [2025-01-10 00:45:47,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:45:47,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:45:47,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:45:47,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:45:47,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:45:47,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:45:47,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:45:47,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:45:47,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987255123] [2025-01-10 00:45:47,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987255123] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:45:47,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:45:47,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:45:47,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249994880] [2025-01-10 00:45:47,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:45:47,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:45:47,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:45:47,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:45:47,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:45:47,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2025-01-10 00:45:47,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 49 transitions, 193 flow. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:45:47,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:45:47,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2025-01-10 00:45:47,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:45:49,563 INFO L124 PetriNetUnfolderBase]: 15914/25320 cut-off events. [2025-01-10 00:45:49,563 INFO L125 PetriNetUnfolderBase]: For 22091/23622 co-relation queries the response was YES. [2025-01-10 00:45:49,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66012 conditions, 25320 events. 15914/25320 cut-off events. For 22091/23622 co-relation queries the response was YES. Maximal size of possible extension queue 1310. Compared 202475 event pairs, 4135 based on Foata normal form. 713/24958 useless extension candidates. Maximal degree in co-relation 65997. Up to 14194 conditions per place. [2025-01-10 00:45:49,770 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 34 selfloop transitions, 3 changer transitions 43/102 dead transitions. [2025-01-10 00:45:49,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 102 transitions, 517 flow [2025-01-10 00:45:49,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:45:49,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:45:49,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 237 transitions. [2025-01-10 00:45:49,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6155844155844156 [2025-01-10 00:45:49,772 INFO L175 Difference]: Start difference. First operand has 70 places, 49 transitions, 193 flow. Second operand 7 states and 237 transitions. [2025-01-10 00:45:49,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 102 transitions, 517 flow [2025-01-10 00:45:49,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 102 transitions, 467 flow, removed 14 selfloop flow, removed 4 redundant places. [2025-01-10 00:45:49,906 INFO L231 Difference]: Finished difference. Result has 70 places, 49 transitions, 182 flow [2025-01-10 00:45:49,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=182, PETRI_PLACES=70, PETRI_TRANSITIONS=49} [2025-01-10 00:45:49,907 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2025-01-10 00:45:49,907 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 49 transitions, 182 flow [2025-01-10 00:45:49,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:45:49,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:45:49,907 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:45:49,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:45:49,907 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:45:49,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:45:49,908 INFO L85 PathProgramCache]: Analyzing trace with hash 296418292, now seen corresponding path program 1 times [2025-01-10 00:45:49,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:45:49,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119894163] [2025-01-10 00:45:49,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:45:49,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:45:49,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:45:49,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:45:49,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:45:49,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:45:50,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:45:50,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:45:50,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119894163] [2025-01-10 00:45:50,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119894163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:45:50,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:45:50,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:45:50,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065103577] [2025-01-10 00:45:50,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:45:50,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:45:50,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:45:50,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:45:50,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:45:50,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2025-01-10 00:45:50,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 49 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:45:50,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:45:50,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2025-01-10 00:45:50,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:45:52,407 INFO L124 PetriNetUnfolderBase]: 17160/27371 cut-off events. [2025-01-10 00:45:52,408 INFO L125 PetriNetUnfolderBase]: For 24430/24636 co-relation queries the response was YES. [2025-01-10 00:45:52,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69089 conditions, 27371 events. 17160/27371 cut-off events. For 24430/24636 co-relation queries the response was YES. Maximal size of possible extension queue 1327. Compared 217314 event pairs, 5752 based on Foata normal form. 678/27575 useless extension candidates. Maximal degree in co-relation 69071. Up to 18045 conditions per place. [2025-01-10 00:45:52,556 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 40 selfloop transitions, 5 changer transitions 47/112 dead transitions. [2025-01-10 00:45:52,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 112 transitions, 592 flow [2025-01-10 00:45:52,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:45:52,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:45:52,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 240 transitions. [2025-01-10 00:45:52,557 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6233766233766234 [2025-01-10 00:45:52,557 INFO L175 Difference]: Start difference. First operand has 70 places, 49 transitions, 182 flow. Second operand 7 states and 240 transitions. [2025-01-10 00:45:52,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 112 transitions, 592 flow [2025-01-10 00:45:52,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 112 transitions, 566 flow, removed 10 selfloop flow, removed 8 redundant places. [2025-01-10 00:45:52,867 INFO L231 Difference]: Finished difference. Result has 69 places, 52 transitions, 219 flow [2025-01-10 00:45:52,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=219, PETRI_PLACES=69, PETRI_TRANSITIONS=52} [2025-01-10 00:45:52,867 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2025-01-10 00:45:52,867 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 52 transitions, 219 flow [2025-01-10 00:45:52,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:45:52,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:45:52,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:45:52,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:45:52,868 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:45:52,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:45:52,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1652289709, now seen corresponding path program 1 times [2025-01-10 00:45:52,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:45:52,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186710617] [2025-01-10 00:45:52,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:45:52,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:45:52,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:45:52,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:45:52,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:45:52,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:45:52,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:45:52,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:45:52,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186710617] [2025-01-10 00:45:52,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186710617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:45:52,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:45:52,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:45:52,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857895697] [2025-01-10 00:45:52,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:45:52,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:45:52,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:45:52,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:45:52,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:45:52,977 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2025-01-10 00:45:52,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 52 transitions, 219 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:45:52,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:45:52,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2025-01-10 00:45:52,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:45:56,562 INFO L124 PetriNetUnfolderBase]: 30922/46410 cut-off events. [2025-01-10 00:45:56,563 INFO L125 PetriNetUnfolderBase]: For 28735/31465 co-relation queries the response was YES. [2025-01-10 00:45:56,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110494 conditions, 46410 events. 30922/46410 cut-off events. For 28735/31465 co-relation queries the response was YES. Maximal size of possible extension queue 1931. Compared 348440 event pairs, 5076 based on Foata normal form. 1621/46719 useless extension candidates. Maximal degree in co-relation 110477. Up to 25055 conditions per place. [2025-01-10 00:45:56,948 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 57 selfloop transitions, 6 changer transitions 0/86 dead transitions. [2025-01-10 00:45:56,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 86 transitions, 435 flow [2025-01-10 00:45:56,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:45:56,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:45:56,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2025-01-10 00:45:56,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6636363636363637 [2025-01-10 00:45:56,950 INFO L175 Difference]: Start difference. First operand has 69 places, 52 transitions, 219 flow. Second operand 4 states and 146 transitions. [2025-01-10 00:45:56,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 86 transitions, 435 flow [2025-01-10 00:45:57,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 86 transitions, 426 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 00:45:57,146 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 256 flow [2025-01-10 00:45:57,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=256, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2025-01-10 00:45:57,147 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2025-01-10 00:45:57,147 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 256 flow [2025-01-10 00:45:57,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:45:57,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:45:57,147 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-01-10 00:45:57,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:45:57,147 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:45:57,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:45:57,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1616473434, now seen corresponding path program 1 times [2025-01-10 00:45:57,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:45:57,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476449850] [2025-01-10 00:45:57,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:45:57,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:45:57,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:45:57,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:45:57,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:45:57,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:45:57,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:45:57,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:45:57,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476449850] [2025-01-10 00:45:57,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476449850] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:45:57,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:45:57,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:45:57,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935535505] [2025-01-10 00:45:57,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:45:57,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:45:57,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:45:57,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:45:57,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:45:57,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 55 [2025-01-10 00:45:57,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:45:57,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:45:57,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 55 [2025-01-10 00:45:57,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:46:02,203 INFO L124 PetriNetUnfolderBase]: 36782/54761 cut-off events. [2025-01-10 00:46:02,203 INFO L125 PetriNetUnfolderBase]: For 58701/61772 co-relation queries the response was YES. [2025-01-10 00:46:02,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152877 conditions, 54761 events. 36782/54761 cut-off events. For 58701/61772 co-relation queries the response was YES. Maximal size of possible extension queue 2461. Compared 423450 event pairs, 11397 based on Foata normal form. 911/52720 useless extension candidates. Maximal degree in co-relation 152859. Up to 24941 conditions per place. [2025-01-10 00:46:02,668 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 109 selfloop transitions, 14 changer transitions 0/142 dead transitions. [2025-01-10 00:46:02,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 142 transitions, 834 flow [2025-01-10 00:46:02,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:46:02,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:46:02,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 271 transitions. [2025-01-10 00:46:02,670 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.615909090909091 [2025-01-10 00:46:02,670 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 256 flow. Second operand 8 states and 271 transitions. [2025-01-10 00:46:02,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 142 transitions, 834 flow [2025-01-10 00:46:02,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 142 transitions, 826 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-01-10 00:46:02,686 INFO L231 Difference]: Finished difference. Result has 79 places, 64 transitions, 367 flow [2025-01-10 00:46:02,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=367, PETRI_PLACES=79, PETRI_TRANSITIONS=64} [2025-01-10 00:46:02,686 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 17 predicate places. [2025-01-10 00:46:02,686 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 64 transitions, 367 flow [2025-01-10 00:46:02,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:46:02,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:46:02,688 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-01-10 00:46:02,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:46:02,688 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:46:02,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:46:02,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1872748772, now seen corresponding path program 1 times [2025-01-10 00:46:02,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:46:02,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846784774] [2025-01-10 00:46:02,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:46:02,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:46:02,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:46:02,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:46:02,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:46:02,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:46:02,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:46:02,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:46:02,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846784774] [2025-01-10 00:46:02,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846784774] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:46:02,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:46:02,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:46:02,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368007668] [2025-01-10 00:46:02,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:46:02,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:46:02,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:46:02,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:46:02,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:46:02,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 55 [2025-01-10 00:46:02,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 64 transitions, 367 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:46:02,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:46:02,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 55 [2025-01-10 00:46:02,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand