./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_04-priv_multi_true.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/goblint-regression/13-privatized_04-priv_multi_true.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 d5772eac83993f999ed7a0d2c72e283c734e18136b4020af8f8e407255c20c04 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:56:38,420 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:56:38,460 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:56:38,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:56:38,464 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:56:38,483 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:56:38,484 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:56:38,484 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:56:38,484 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:56:38,485 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:56:38,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:56:38,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:56:38,486 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:56:38,486 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:56:38,486 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:56:38,486 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:56:38,486 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:56:38,486 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:56:38,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:56:38,486 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:56:38,486 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:56:38,486 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:56:38,487 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:56:38,487 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:56:38,487 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:56:38,487 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:56:38,487 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:56:38,487 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:56:38,487 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:56:38,487 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:56:38,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:56:38,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:56:38,488 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:56:38,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:56:38,488 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:56:38,488 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:56:38,488 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:56:38,488 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:56:38,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:56:38,489 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:56:38,489 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:56:38,489 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:56:38,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:56:38,489 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:56:38,489 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:56:38,489 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:56:38,489 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:56:38,490 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 -> d5772eac83993f999ed7a0d2c72e283c734e18136b4020af8f8e407255c20c04 [2025-01-10 00:56:38,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:56:38,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:56:38,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:56:38,760 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:56:38,760 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:56:38,761 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_04-priv_multi_true.i [2025-01-10 00:56:39,978 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c5f7a573c/5f4ea88c902248368e33a93320af4b92/FLAGdd558b3c0 [2025-01-10 00:56:40,342 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:56:40,343 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_04-priv_multi_true.i [2025-01-10 00:56:40,359 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c5f7a573c/5f4ea88c902248368e33a93320af4b92/FLAGdd558b3c0 [2025-01-10 00:56:40,554 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c5f7a573c/5f4ea88c902248368e33a93320af4b92 [2025-01-10 00:56:40,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:56:40,557 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:56:40,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:56:40,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:56:40,561 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:56:40,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:56:40" (1/1) ... [2025-01-10 00:56:40,562 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@735ecb87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:56:40, skipping insertion in model container [2025-01-10 00:56:40,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:56:40" (1/1) ... [2025-01-10 00:56:40,586 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:56:40,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:56:40,839 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:56:40,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:56:40,905 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:56:40,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:56:40 WrapperNode [2025-01-10 00:56:40,906 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:56:40,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:56:40,907 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:56:40,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:56:40,910 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:56:40" (1/1) ... [2025-01-10 00:56:40,919 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:56:40" (1/1) ... [2025-01-10 00:56:40,939 INFO L138 Inliner]: procedures = 271, calls = 38, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 98 [2025-01-10 00:56:40,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:56:40,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:56:40,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:56:40,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:56:40,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:56:40" (1/1) ... [2025-01-10 00:56:40,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:56:40" (1/1) ... [2025-01-10 00:56:40,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:56:40" (1/1) ... [2025-01-10 00:56:40,958 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 5, 5]. 42 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 0 writes are split as follows [0, 0, 0]. [2025-01-10 00:56:40,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:56:40" (1/1) ... [2025-01-10 00:56:40,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:56:40" (1/1) ... [2025-01-10 00:56:40,964 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:56:40" (1/1) ... [2025-01-10 00:56:40,964 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:56:40" (1/1) ... [2025-01-10 00:56:40,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:56:40" (1/1) ... [2025-01-10 00:56:40,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:56:40" (1/1) ... [2025-01-10 00:56:40,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:56:40" (1/1) ... [2025-01-10 00:56:40,971 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:56:40,971 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:56:40,971 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:56:40,972 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:56:40,972 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:56:40" (1/1) ... [2025-01-10 00:56:40,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:56:40,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:56:40,996 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:56:40,999 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:56:41,021 INFO L130 BoogieDeclarations]: Found specification of procedure generate [2025-01-10 00:56:41,021 INFO L138 BoogieDeclarations]: Found implementation of procedure generate [2025-01-10 00:56:41,021 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:56:41,021 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:56:41,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:56:41,021 INFO L130 BoogieDeclarations]: Found specification of procedure dispose [2025-01-10 00:56:41,021 INFO L138 BoogieDeclarations]: Found implementation of procedure dispose [2025-01-10 00:56:41,022 INFO L130 BoogieDeclarations]: Found specification of procedure process [2025-01-10 00:56:41,022 INFO L138 BoogieDeclarations]: Found implementation of procedure process [2025-01-10 00:56:41,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:56:41,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:56:41,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:56:41,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:56:41,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:56:41,023 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:56:41,232 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:56:41,234 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:56:41,411 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:56:41,411 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:56:41,523 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:56:41,523 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 00:56:41,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:56:41 BoogieIcfgContainer [2025-01-10 00:56:41,524 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:56:41,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:56:41,526 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:56:41,530 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:56:41,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:56:40" (1/3) ... [2025-01-10 00:56:41,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f761fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:56:41, skipping insertion in model container [2025-01-10 00:56:41,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:56:40" (2/3) ... [2025-01-10 00:56:41,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f761fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:56:41, skipping insertion in model container [2025-01-10 00:56:41,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:56:41" (3/3) ... [2025-01-10 00:56:41,532 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_04-priv_multi_true.i [2025-01-10 00:56:41,544 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:56:41,549 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_04-priv_multi_true.i that has 4 procedures, 60 locations, 1 initial locations, 4 loop locations, and 3 error locations. [2025-01-10 00:56:41,549 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:56:41,605 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:56:41,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 69 transitions, 150 flow [2025-01-10 00:56:41,655 INFO L124 PetriNetUnfolderBase]: 10/66 cut-off events. [2025-01-10 00:56:41,658 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:56:41,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 66 events. 10/66 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 168 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2025-01-10 00:56:41,665 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 69 transitions, 150 flow [2025-01-10 00:56:41,670 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 66 transitions, 141 flow [2025-01-10 00:56:41,682 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:56:41,693 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;@588e1bc0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:56:41,694 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-10 00:56:41,706 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:56:41,707 INFO L124 PetriNetUnfolderBase]: 1/27 cut-off events. [2025-01-10 00:56:41,707 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:56:41,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:56:41,708 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:56:41,708 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 00:56:41,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:56:41,712 INFO L85 PathProgramCache]: Analyzing trace with hash -181559, now seen corresponding path program 1 times [2025-01-10 00:56:41,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:56:41,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810870479] [2025-01-10 00:56:41,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:56:41,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:56:41,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:56:41,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:56:41,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:41,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:42,105 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:56:42,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:56:42,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810870479] [2025-01-10 00:56:42,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810870479] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:56:42,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:56:42,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:56:42,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543429769] [2025-01-10 00:56:42,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:56:42,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:56:42,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:56:42,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:56:42,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:56:42,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 69 [2025-01-10 00:56:42,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 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:56:42,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:56:42,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 69 [2025-01-10 00:56:42,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:56:44,719 INFO L124 PetriNetUnfolderBase]: 24233/38167 cut-off events. [2025-01-10 00:56:44,721 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-01-10 00:56:44,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70552 conditions, 38167 events. 24233/38167 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 966. Compared 288922 event pairs, 12107 based on Foata normal form. 4188/42172 useless extension candidates. Maximal degree in co-relation 70541. Up to 18819 conditions per place. [2025-01-10 00:56:44,971 INFO L140 encePairwiseOnDemand]: 60/69 looper letters, 67 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2025-01-10 00:56:44,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 88 transitions, 323 flow [2025-01-10 00:56:44,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:56:44,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:56:44,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2025-01-10 00:56:44,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.714975845410628 [2025-01-10 00:56:44,985 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 141 flow. Second operand 3 states and 148 transitions. [2025-01-10 00:56:44,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 88 transitions, 323 flow [2025-01-10 00:56:44,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 88 transitions, 320 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:56:44,995 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 134 flow [2025-01-10 00:56:44,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=62, PETRI_TRANSITIONS=59} [2025-01-10 00:56:45,000 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -4 predicate places. [2025-01-10 00:56:45,000 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 134 flow [2025-01-10 00:56:45,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 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:56:45,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:56:45,001 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:56:45,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:56:45,002 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting disposeErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 00:56:45,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:56:45,002 INFO L85 PathProgramCache]: Analyzing trace with hash -733776112, now seen corresponding path program 1 times [2025-01-10 00:56:45,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:56:45,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619978164] [2025-01-10 00:56:45,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:56:45,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:56:45,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:56:45,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:56:45,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:45,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:45,255 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:56:45,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:56:45,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619978164] [2025-01-10 00:56:45,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619978164] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:56:45,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:56:45,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:56:45,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890986294] [2025-01-10 00:56:45,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:56:45,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:56:45,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:56:45,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:56:45,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:56:45,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 69 [2025-01-10 00:56:45,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 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:56:45,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:56:45,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 69 [2025-01-10 00:56:45,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:56:49,675 INFO L124 PetriNetUnfolderBase]: 62561/90751 cut-off events. [2025-01-10 00:56:49,675 INFO L125 PetriNetUnfolderBase]: For 5882/5882 co-relation queries the response was YES. [2025-01-10 00:56:49,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177597 conditions, 90751 events. 62561/90751 cut-off events. For 5882/5882 co-relation queries the response was YES. Maximal size of possible extension queue 1950. Compared 653072 event pairs, 9196 based on Foata normal form. 0/87820 useless extension candidates. Maximal degree in co-relation 177587. Up to 33793 conditions per place. [2025-01-10 00:56:50,059 INFO L140 encePairwiseOnDemand]: 61/69 looper letters, 196 selfloop transitions, 12 changer transitions 0/225 dead transitions. [2025-01-10 00:56:50,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 225 transitions, 944 flow [2025-01-10 00:56:50,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:56:50,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:56:50,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 365 transitions. [2025-01-10 00:56:50,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6612318840579711 [2025-01-10 00:56:50,066 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 134 flow. Second operand 8 states and 365 transitions. [2025-01-10 00:56:50,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 225 transitions, 944 flow [2025-01-10 00:56:50,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 225 transitions, 930 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:56:50,078 INFO L231 Difference]: Finished difference. Result has 74 places, 69 transitions, 220 flow [2025-01-10 00:56:50,078 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=220, PETRI_PLACES=74, PETRI_TRANSITIONS=69} [2025-01-10 00:56:50,079 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 8 predicate places. [2025-01-10 00:56:50,079 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 69 transitions, 220 flow [2025-01-10 00:56:50,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 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:56:50,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:56:50,080 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:56:50,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:56:50,081 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 00:56:50,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:56:50,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1736398060, now seen corresponding path program 1 times [2025-01-10 00:56:50,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:56:50,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665301856] [2025-01-10 00:56:50,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:56:50,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:56:50,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:56:50,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:56:50,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:50,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:50,270 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:56:50,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:56:50,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665301856] [2025-01-10 00:56:50,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665301856] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:56:50,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:56:50,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:56:50,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009244899] [2025-01-10 00:56:50,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:56:50,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:56:50,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:56:50,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:56:50,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:56:50,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 69 [2025-01-10 00:56:50,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 69 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 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:56:50,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:56:50,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 69 [2025-01-10 00:56:50,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:56:55,902 INFO L124 PetriNetUnfolderBase]: 68375/102273 cut-off events. [2025-01-10 00:56:55,903 INFO L125 PetriNetUnfolderBase]: For 38714/40058 co-relation queries the response was YES. [2025-01-10 00:56:56,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226962 conditions, 102273 events. 68375/102273 cut-off events. For 38714/40058 co-relation queries the response was YES. Maximal size of possible extension queue 2208. Compared 789001 event pairs, 14011 based on Foata normal form. 0/99640 useless extension candidates. Maximal degree in co-relation 226945. Up to 69157 conditions per place. [2025-01-10 00:56:56,564 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 117 selfloop transitions, 9 changer transitions 0/145 dead transitions. [2025-01-10 00:56:56,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 145 transitions, 723 flow [2025-01-10 00:56:56,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:56:56,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:56:56,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 211 transitions. [2025-01-10 00:56:56,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6115942028985507 [2025-01-10 00:56:56,565 INFO L175 Difference]: Start difference. First operand has 74 places, 69 transitions, 220 flow. Second operand 5 states and 211 transitions. [2025-01-10 00:56:56,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 145 transitions, 723 flow [2025-01-10 00:56:57,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 145 transitions, 723 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:56:57,112 INFO L231 Difference]: Finished difference. Result has 82 places, 76 transitions, 286 flow [2025-01-10 00:56:57,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=286, PETRI_PLACES=82, PETRI_TRANSITIONS=76} [2025-01-10 00:56:57,113 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 16 predicate places. [2025-01-10 00:56:57,113 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 76 transitions, 286 flow [2025-01-10 00:56:57,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 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:56:57,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:56:57,113 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:56:57,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:56:57,113 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 00:56:57,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:56:57,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1134651792, now seen corresponding path program 1 times [2025-01-10 00:56:57,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:56:57,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080625081] [2025-01-10 00:56:57,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:56:57,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:56:57,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:56:57,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:56:57,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:57,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:57,207 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:56:57,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:56:57,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080625081] [2025-01-10 00:56:57,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080625081] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:56:57,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:56:57,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:56:57,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807175745] [2025-01-10 00:56:57,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:56:57,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:56:57,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:56:57,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:56:57,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:56:57,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 69 [2025-01-10 00:56:57,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 76 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 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:56:57,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:56:57,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 69 [2025-01-10 00:56:57,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:06,774 INFO L124 PetriNetUnfolderBase]: 101018/157262 cut-off events. [2025-01-10 00:57:06,775 INFO L125 PetriNetUnfolderBase]: For 125449/129811 co-relation queries the response was YES. [2025-01-10 00:57:07,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397515 conditions, 157262 events. 101018/157262 cut-off events. For 125449/129811 co-relation queries the response was YES. Maximal size of possible extension queue 3624. Compared 1348534 event pairs, 23774 based on Foata normal form. 6692/162895 useless extension candidates. Maximal degree in co-relation 397492. Up to 81023 conditions per place. [2025-01-10 00:57:07,906 INFO L140 encePairwiseOnDemand]: 58/69 looper letters, 94 selfloop transitions, 11 changer transitions 0/126 dead transitions. [2025-01-10 00:57:07,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 126 transitions, 705 flow [2025-01-10 00:57:07,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:57:07,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:57:07,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2025-01-10 00:57:07,907 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6859903381642513 [2025-01-10 00:57:07,907 INFO L175 Difference]: Start difference. First operand has 82 places, 76 transitions, 286 flow. Second operand 3 states and 142 transitions. [2025-01-10 00:57:07,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 126 transitions, 705 flow [2025-01-10 00:57:09,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 126 transitions, 705 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:57:09,669 INFO L231 Difference]: Finished difference. Result has 85 places, 84 transitions, 351 flow [2025-01-10 00:57:09,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=351, PETRI_PLACES=85, PETRI_TRANSITIONS=84} [2025-01-10 00:57:09,670 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 19 predicate places. [2025-01-10 00:57:09,670 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 84 transitions, 351 flow [2025-01-10 00:57:09,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 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:57:09,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:09,671 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:57:09,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:57:09,671 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 00:57:09,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:09,671 INFO L85 PathProgramCache]: Analyzing trace with hash -988622947, now seen corresponding path program 1 times [2025-01-10 00:57:09,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:09,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243278703] [2025-01-10 00:57:09,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:09,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:09,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:57:09,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:57:09,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:09,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:09,820 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:57:09,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:09,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243278703] [2025-01-10 00:57:09,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243278703] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:09,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:09,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:57:09,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733859150] [2025-01-10 00:57:09,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:09,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:57:09,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:09,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:57:09,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:57:09,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 69 [2025-01-10 00:57:09,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 84 transitions, 351 flow. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:57:09,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:09,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 69 [2025-01-10 00:57:09,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand