./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-lit/sssc12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d 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-lit/sssc12.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 94001a9ab0492f7774a7e81f183179cf0060947b701e48f51b2989eec22ae051 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:27:28,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:27:28,237 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:27:28,241 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:27:28,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:27:28,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:27:28,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:27:28,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:27:28,261 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:27:28,261 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:27:28,261 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:27:28,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:27:28,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:27:28,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:27:28,262 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:27:28,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:27:28,262 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:27:28,262 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:27:28,262 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:27:28,262 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:27:28,262 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:27:28,262 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:27:28,262 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:27:28,263 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:27:28,263 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:27:28,263 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:27:28,263 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:27:28,263 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:27:28,263 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:27:28,263 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:27:28,263 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:27:28,263 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:27:28,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:27:28,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:27:28,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:27:28,264 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:27:28,264 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:27:28,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:27:28,264 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:27:28,264 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:27:28,264 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:27:28,264 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:27:28,264 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 -> 94001a9ab0492f7774a7e81f183179cf0060947b701e48f51b2989eec22ae051 [2025-02-08 08:27:28,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:27:28,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:27:28,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:27:28,527 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:27:28,527 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:27:28,528 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/sssc12.i [2025-02-08 08:27:29,730 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b888ebf7b/8246864f6947486a822d71828df108d1/FLAGcbe59907e [2025-02-08 08:27:30,017 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:27:30,018 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12.i [2025-02-08 08:27:30,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b888ebf7b/8246864f6947486a822d71828df108d1/FLAGcbe59907e [2025-02-08 08:27:30,281 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b888ebf7b/8246864f6947486a822d71828df108d1 [2025-02-08 08:27:30,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:27:30,284 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:27:30,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:27:30,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:27:30,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:27:30,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:27:30" (1/1) ... [2025-02-08 08:27:30,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf32be2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:30, skipping insertion in model container [2025-02-08 08:27:30,294 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:27:30" (1/1) ... [2025-02-08 08:27:30,324 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:27:30,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:27:30,557 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:27:30,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:27:30,616 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:27:30,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:30 WrapperNode [2025-02-08 08:27:30,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:27:30,617 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:27:30,617 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:27:30,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:27:30,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:30" (1/1) ... [2025-02-08 08:27:30,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:30" (1/1) ... [2025-02-08 08:27:30,643 INFO L138 Inliner]: procedures = 272, calls = 20, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 69 [2025-02-08 08:27:30,643 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:27:30,644 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:27:30,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:27:30,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:27:30,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:30" (1/1) ... [2025-02-08 08:27:30,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:30" (1/1) ... [2025-02-08 08:27:30,650 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:30" (1/1) ... [2025-02-08 08:27:30,658 INFO L175 MemorySlicer]: Split 8 memory accesses to 3 slices as follows [2, 5, 1]. 63 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 1 writes are split as follows [0, 0, 1]. [2025-02-08 08:27:30,658 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:30" (1/1) ... [2025-02-08 08:27:30,658 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:30" (1/1) ... [2025-02-08 08:27:30,662 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:30" (1/1) ... [2025-02-08 08:27:30,662 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:30" (1/1) ... [2025-02-08 08:27:30,663 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:30" (1/1) ... [2025-02-08 08:27:30,664 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:30" (1/1) ... [2025-02-08 08:27:30,665 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:27:30,665 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:27:30,665 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:27:30,666 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:27:30,666 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:30" (1/1) ... [2025-02-08 08:27:30,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:27:30,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:27:30,705 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-02-08 08:27:30,707 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-02-08 08:27:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2025-02-08 08:27:30,722 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2025-02-08 08:27:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 08:27:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:27:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:27:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 08:27:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 08:27:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 08:27:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:27:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:27:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:27:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 08:27:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:27:30,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:27:30,724 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:27:30,873 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:27:30,880 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:27:31,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047: havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; [2025-02-08 08:27:31,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047-1: havoc __VERIFIER_assert_~cond#1; [2025-02-08 08:27:31,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048: ~c~0#1 := 1 + ~c~0#1; [2025-02-08 08:27:31,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048-1: SUMMARY for call write~int#2(0, ~data~0.base, ~data~0.offset + 4 * ~c~0#1, 4); srcloc: null [2025-02-08 08:27:31,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048-1: assume !(1 == #valid[~data~0.base]); [2025-02-08 08:27:31,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048-1: assume !(4 + (~data~0.offset + 4 * ~c~0#1) <= #length[~data~0.base] && 0 <= ~data~0.offset + 4 * ~c~0#1); [2025-02-08 08:27:31,017 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:27:31,017 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:27:31,103 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:27:31,103 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:27:31,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:27:31 BoogieIcfgContainer [2025-02-08 08:27:31,104 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:27:31,105 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:27:31,105 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:27:31,109 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:27:31,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:27:30" (1/3) ... [2025-02-08 08:27:31,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5d5a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:27:31, skipping insertion in model container [2025-02-08 08:27:31,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:30" (2/3) ... [2025-02-08 08:27:31,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5d5a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:27:31, skipping insertion in model container [2025-02-08 08:27:31,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:27:31" (3/3) ... [2025-02-08 08:27:31,111 INFO L128 eAbstractionObserver]: Analyzing ICFG sssc12.i [2025-02-08 08:27:31,122 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:27:31,124 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sssc12.i that has 2 procedures, 20 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-02-08 08:27:31,124 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:27:31,157 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:27:31,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 22 transitions, 48 flow [2025-02-08 08:27:31,206 INFO L124 PetriNetUnfolderBase]: 2/26 cut-off events. [2025-02-08 08:27:31,208 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:27:31,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 26 events. 2/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-02-08 08:27:31,210 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 22 transitions, 48 flow [2025-02-08 08:27:31,212 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 22 transitions, 48 flow [2025-02-08 08:27:31,219 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:27:31,227 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;@79d3df77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:27:31,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 08:27:31,230 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:27:31,231 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-08 08:27:31,231 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:27:31,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:31,231 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:27:31,232 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr2ASSERT_VIOLATIONMEMORY_LEAK (and 1 more)] === [2025-02-08 08:27:31,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:31,240 INFO L85 PathProgramCache]: Analyzing trace with hash 185233, now seen corresponding path program 1 times [2025-02-08 08:27:31,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:31,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582901109] [2025-02-08 08:27:31,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:31,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:31,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:27:31,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:27:31,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:31,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:31,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:31,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:31,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582901109] [2025-02-08 08:27:31,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582901109] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:31,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:31,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:27:31,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136880358] [2025-02-08 08:27:31,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:31,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:27:31,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:31,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:27:31,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:27:31,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2025-02-08 08:27:31,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 22 transitions, 48 flow. Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-02-08 08:27:31,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:31,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2025-02-08 08:27:31,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:31,463 INFO L124 PetriNetUnfolderBase]: 14/54 cut-off events. [2025-02-08 08:27:31,463 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:27:31,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 54 events. 14/54 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 116 event pairs, 14 based on Foata normal form. 6/57 useless extension candidates. Maximal degree in co-relation 86. Up to 41 conditions per place. [2025-02-08 08:27:31,464 INFO L140 encePairwiseOnDemand]: 19/22 looper letters, 11 selfloop transitions, 0 changer transitions 0/16 dead transitions. [2025-02-08 08:27:31,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 16 transitions, 58 flow [2025-02-08 08:27:31,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:27:31,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:27:31,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 26 transitions. [2025-02-08 08:27:31,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2025-02-08 08:27:31,476 INFO L175 Difference]: Start difference. First operand has 23 places, 22 transitions, 48 flow. Second operand 2 states and 26 transitions. [2025-02-08 08:27:31,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 16 transitions, 58 flow [2025-02-08 08:27:31,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 16 transitions, 58 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:27:31,480 INFO L231 Difference]: Finished difference. Result has 20 places, 16 transitions, 36 flow [2025-02-08 08:27:31,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=36, PETRI_PLACES=20, PETRI_TRANSITIONS=16} [2025-02-08 08:27:31,483 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, -3 predicate places. [2025-02-08 08:27:31,483 INFO L471 AbstractCegarLoop]: Abstraction has has 20 places, 16 transitions, 36 flow [2025-02-08 08:27:31,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-02-08 08:27:31,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:31,484 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 08:27:31,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:27:31,484 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr2ASSERT_VIOLATIONMEMORY_LEAK (and 1 more)] === [2025-02-08 08:27:31,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:31,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1223359695, now seen corresponding path program 1 times [2025-02-08 08:27:31,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:31,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609037441] [2025-02-08 08:27:31,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:31,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:31,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:27:31,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:27:31,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:31,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:27:31,504 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:27:31,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:27:31,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:27:31,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:31,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:27:31,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:27:31,525 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:27:31,526 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-02-08 08:27:31,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-02-08 08:27:31,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONMEMORY_LEAK (1 of 4 remaining) [2025-02-08 08:27:31,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONMEMORY_LEAK (0 of 4 remaining) [2025-02-08 08:27:31,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:27:31,528 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 08:27:31,530 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:27:31,530 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 08:27:31,544 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:27:31,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 37 transitions, 84 flow [2025-02-08 08:27:31,559 INFO L124 PetriNetUnfolderBase]: 4/46 cut-off events. [2025-02-08 08:27:31,559 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:27:31,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 46 events. 4/46 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 102 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 33. Up to 3 conditions per place. [2025-02-08 08:27:31,560 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 37 transitions, 84 flow [2025-02-08 08:27:31,560 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 37 transitions, 84 flow [2025-02-08 08:27:31,563 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:27:31,564 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;@79d3df77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:27:31,564 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-08 08:27:31,566 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:27:31,566 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-08 08:27:31,566 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:27:31,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:31,566 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:27:31,567 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr2ASSERT_VIOLATIONMEMORY_LEAK (and 2 more)] === [2025-02-08 08:27:31,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:31,567 INFO L85 PathProgramCache]: Analyzing trace with hash 221974, now seen corresponding path program 1 times [2025-02-08 08:27:31,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:31,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283721167] [2025-02-08 08:27:31,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:31,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:31,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:27:31,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:27:31,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:31,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:31,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:31,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:31,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283721167] [2025-02-08 08:27:31,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283721167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:31,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:31,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:27:31,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481400594] [2025-02-08 08:27:31,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:31,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:27:31,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:31,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:27:31,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:27:31,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-02-08 08:27:31,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 37 transitions, 84 flow. Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-02-08 08:27:31,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:31,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-02-08 08:27:31,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:31,705 INFO L124 PetriNetUnfolderBase]: 294/671 cut-off events. [2025-02-08 08:27:31,706 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-02-08 08:27:31,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 671 events. 294/671 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3577 event pairs, 294 based on Foata normal form. 102/716 useless extension candidates. Maximal degree in co-relation 804. Up to 513 conditions per place. [2025-02-08 08:27:31,711 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 19 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2025-02-08 08:27:31,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 28 transitions, 104 flow [2025-02-08 08:27:31,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:27:31,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:27:31,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 44 transitions. [2025-02-08 08:27:31,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5945945945945946 [2025-02-08 08:27:31,712 INFO L175 Difference]: Start difference. First operand has 38 places, 37 transitions, 84 flow. Second operand 2 states and 44 transitions. [2025-02-08 08:27:31,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 28 transitions, 104 flow [2025-02-08 08:27:31,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 28 transitions, 104 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:27:31,717 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 66 flow [2025-02-08 08:27:31,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=66, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2025-02-08 08:27:31,717 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -4 predicate places. [2025-02-08 08:27:31,717 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 66 flow [2025-02-08 08:27:31,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-02-08 08:27:31,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:31,718 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-02-08 08:27:31,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:27:31,718 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr2ASSERT_VIOLATIONMEMORY_LEAK (and 2 more)] === [2025-02-08 08:27:31,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:31,718 INFO L85 PathProgramCache]: Analyzing trace with hash -967383682, now seen corresponding path program 1 times [2025-02-08 08:27:31,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:31,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882556843] [2025-02-08 08:27:31,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:31,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:31,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:27:31,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:27:31,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:31,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:27:31,750 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:27:31,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:27:31,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:27:31,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:31,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:27:31,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:27:31,772 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:27:31,772 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-02-08 08:27:31,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-02-08 08:27:31,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2025-02-08 08:27:31,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONMEMORY_LEAK (1 of 5 remaining) [2025-02-08 08:27:31,773 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-02-08 08:27:31,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:27:31,773 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 08:27:31,773 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:27:31,773 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 08:27:31,799 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:27:31,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 52 transitions, 122 flow [2025-02-08 08:27:31,809 INFO L124 PetriNetUnfolderBase]: 6/66 cut-off events. [2025-02-08 08:27:31,809 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 08:27:31,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 66 events. 6/66 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 180 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 53. Up to 4 conditions per place. [2025-02-08 08:27:31,810 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 52 transitions, 122 flow [2025-02-08 08:27:31,812 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 52 transitions, 122 flow [2025-02-08 08:27:31,812 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:27:31,813 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;@79d3df77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:27:31,813 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 08:27:31,814 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:27:31,814 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-08 08:27:31,814 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:27:31,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:31,814 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:27:31,814 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr2ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:27:31,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:31,814 INFO L85 PathProgramCache]: Analyzing trace with hash 273610, now seen corresponding path program 1 times [2025-02-08 08:27:31,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:31,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321989134] [2025-02-08 08:27:31,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:31,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:31,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:27:31,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:27:31,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:31,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:31,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:31,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:31,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321989134] [2025-02-08 08:27:31,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321989134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:31,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:31,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:27:31,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427864267] [2025-02-08 08:27:31,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:31,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:27:31,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:31,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:27:31,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:27:31,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2025-02-08 08:27:31,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 52 transitions, 122 flow. Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-02-08 08:27:31,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:31,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2025-02-08 08:27:31,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:32,442 INFO L124 PetriNetUnfolderBase]: 3878/7033 cut-off events. [2025-02-08 08:27:32,442 INFO L125 PetriNetUnfolderBase]: For 460/460 co-relation queries the response was YES. [2025-02-08 08:27:32,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12952 conditions, 7033 events. 3878/7033 cut-off events. For 460/460 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 50536 event pairs, 3878 based on Foata normal form. 1233/7582 useless extension candidates. Maximal degree in co-relation 1945. Up to 5633 conditions per place. [2025-02-08 08:27:32,486 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 27 selfloop transitions, 0 changer transitions 0/40 dead transitions. [2025-02-08 08:27:32,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 40 transitions, 152 flow [2025-02-08 08:27:32,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:27:32,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:27:32,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2025-02-08 08:27:32,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5961538461538461 [2025-02-08 08:27:32,487 INFO L175 Difference]: Start difference. First operand has 53 places, 52 transitions, 122 flow. Second operand 2 states and 62 transitions. [2025-02-08 08:27:32,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 40 transitions, 152 flow [2025-02-08 08:27:32,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 150 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 08:27:32,489 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 96 flow [2025-02-08 08:27:32,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=96, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2025-02-08 08:27:32,490 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2025-02-08 08:27:32,490 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 96 flow [2025-02-08 08:27:32,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-02-08 08:27:32,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:32,490 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-02-08 08:27:32,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:27:32,490 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr2ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:27:32,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:32,490 INFO L85 PathProgramCache]: Analyzing trace with hash -93300882, now seen corresponding path program 1 times [2025-02-08 08:27:32,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:32,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142232689] [2025-02-08 08:27:32,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:32,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:32,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:27:32,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:27:32,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:32,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:27:32,504 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:27:32,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:27:32,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:27:32,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:32,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:27:32,515 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:27:32,515 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:27:32,515 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-02-08 08:27:32,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-02-08 08:27:32,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-02-08 08:27:32,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONMEMORY_LEAK (2 of 6 remaining) [2025-02-08 08:27:32,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2025-02-08 08:27:32,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-02-08 08:27:32,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:27:32,516 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 08:27:32,516 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:27:32,516 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 08:27:32,535 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:27:32,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 67 transitions, 162 flow [2025-02-08 08:27:32,574 INFO L124 PetriNetUnfolderBase]: 8/86 cut-off events. [2025-02-08 08:27:32,574 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 08:27:32,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 86 events. 8/86 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 251 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 78. Up to 5 conditions per place. [2025-02-08 08:27:32,575 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 67 transitions, 162 flow [2025-02-08 08:27:32,575 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 67 transitions, 162 flow [2025-02-08 08:27:32,576 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:27:32,576 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;@79d3df77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:27:32,576 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-08 08:27:32,577 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:27:32,577 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-08 08:27:32,577 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:27:32,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:32,578 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:27:32,578 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:32,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:32,578 INFO L85 PathProgramCache]: Analyzing trace with hash 340141, now seen corresponding path program 1 times [2025-02-08 08:27:32,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:32,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566505377] [2025-02-08 08:27:32,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:32,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:32,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:27:32,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:27:32,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:32,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:32,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:32,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:32,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566505377] [2025-02-08 08:27:32,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566505377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:32,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:32,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:27:32,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105338790] [2025-02-08 08:27:32,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:32,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:27:32,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:32,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:27:32,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:27:32,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 67 [2025-02-08 08:27:32,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 67 transitions, 162 flow. Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-02-08 08:27:32,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:32,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 67 [2025-02-08 08:27:32,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:36,133 INFO L124 PetriNetUnfolderBase]: 43302/68684 cut-off events. [2025-02-08 08:27:36,134 INFO L125 PetriNetUnfolderBase]: For 6441/6441 co-relation queries the response was YES. [2025-02-08 08:27:36,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128876 conditions, 68684 events. 43302/68684 cut-off events. For 6441/6441 co-relation queries the response was YES. Maximal size of possible extension queue 2589. Compared 571239 event pairs, 43302 based on Foata normal form. 13353/74801 useless extension candidates. Maximal degree in co-relation 13020. Up to 57345 conditions per place. [2025-02-08 08:27:36,534 INFO L140 encePairwiseOnDemand]: 58/67 looper letters, 35 selfloop transitions, 0 changer transitions 0/52 dead transitions. [2025-02-08 08:27:36,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 52 transitions, 202 flow [2025-02-08 08:27:36,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:27:36,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:27:36,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 80 transitions. [2025-02-08 08:27:36,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5970149253731343 [2025-02-08 08:27:36,536 INFO L175 Difference]: Start difference. First operand has 68 places, 67 transitions, 162 flow. Second operand 2 states and 80 transitions. [2025-02-08 08:27:36,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 52 transitions, 202 flow [2025-02-08 08:27:36,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 52 transitions, 196 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-08 08:27:36,541 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 126 flow [2025-02-08 08:27:36,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=126, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2025-02-08 08:27:36,542 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -6 predicate places. [2025-02-08 08:27:36,542 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 126 flow [2025-02-08 08:27:36,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-02-08 08:27:36,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:36,542 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:36,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:27:36,542 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:36,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:36,543 INFO L85 PathProgramCache]: Analyzing trace with hash -598271808, now seen corresponding path program 1 times [2025-02-08 08:27:36,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:36,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750428454] [2025-02-08 08:27:36,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:36,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:36,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:27:36,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:27:36,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:36,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:36,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:36,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:36,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750428454] [2025-02-08 08:27:36,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750428454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:36,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:36,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:27:36,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197224616] [2025-02-08 08:27:36,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:36,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:27:36,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:36,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:27:36,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:27:36,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 67 [2025-02-08 08:27:36,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 126 flow. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:36,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:36,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 67 [2025-02-08 08:27:36,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:42,641 INFO L124 PetriNetUnfolderBase]: 83531/130615 cut-off events. [2025-02-08 08:27:42,641 INFO L125 PetriNetUnfolderBase]: For 3236/3236 co-relation queries the response was YES. [2025-02-08 08:27:42,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244469 conditions, 130615 events. 83531/130615 cut-off events. For 3236/3236 co-relation queries the response was YES. Maximal size of possible extension queue 5093. Compared 1161083 event pairs, 28429 based on Foata normal form. 0/115135 useless extension candidates. Maximal degree in co-relation 244462. Up to 55047 conditions per place. [2025-02-08 08:27:43,506 INFO L140 encePairwiseOnDemand]: 58/67 looper letters, 137 selfloop transitions, 12 changer transitions 0/165 dead transitions. [2025-02-08 08:27:43,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 165 transitions, 715 flow [2025-02-08 08:27:43,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:27:43,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:27:43,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 269 transitions. [2025-02-08 08:27:43,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5735607675906184 [2025-02-08 08:27:43,511 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 126 flow. Second operand 7 states and 269 transitions. [2025-02-08 08:27:43,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 165 transitions, 715 flow [2025-02-08 08:27:43,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 165 transitions, 715 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:27:43,518 INFO L231 Difference]: Finished difference. Result has 73 places, 63 transitions, 217 flow [2025-02-08 08:27:43,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=217, PETRI_PLACES=73, PETRI_TRANSITIONS=63} [2025-02-08 08:27:43,518 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2025-02-08 08:27:43,519 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 63 transitions, 217 flow [2025-02-08 08:27:43,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:43,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:43,519 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:43,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:27:43,519 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:43,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:43,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1739768656, now seen corresponding path program 1 times [2025-02-08 08:27:43,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:43,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089047982] [2025-02-08 08:27:43,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:43,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:43,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:27:43,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:27:43,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:43,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:27:43,529 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:27:43,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:27:43,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:27:43,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:43,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:27:43,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:27:43,537 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:27:43,537 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-02-08 08:27:43,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-02-08 08:27:43,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-02-08 08:27:43,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2025-02-08 08:27:43,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2025-02-08 08:27:43,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-02-08 08:27:43,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-08 08:27:43,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:27:43,538 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 08:27:43,538 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:27:43,538 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-02-08 08:27:43,563 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:27:43,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 82 transitions, 204 flow [2025-02-08 08:27:43,569 INFO L124 PetriNetUnfolderBase]: 10/106 cut-off events. [2025-02-08 08:27:43,569 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-08 08:27:43,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 106 events. 10/106 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 326 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 104. Up to 6 conditions per place. [2025-02-08 08:27:43,570 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 82 transitions, 204 flow [2025-02-08 08:27:43,571 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 82 transitions, 204 flow [2025-02-08 08:27:43,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:27:43,572 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;@79d3df77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:27:43,572 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-08 08:27:43,573 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:27:43,573 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-08 08:27:43,573 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:27:43,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:43,573 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:27:43,573 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr2ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-08 08:27:43,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:43,573 INFO L85 PathProgramCache]: Analyzing trace with hash 421567, now seen corresponding path program 1 times [2025-02-08 08:27:43,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:43,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976210334] [2025-02-08 08:27:43,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:43,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:43,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:27:43,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:27:43,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:43,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:43,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:27:43,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:43,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976210334] [2025-02-08 08:27:43,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976210334] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:43,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:43,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:27:43,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487823655] [2025-02-08 08:27:43,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:43,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:27:43,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:43,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:27:43,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:27:43,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 82 [2025-02-08 08:27:43,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 82 transitions, 204 flow. Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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-02-08 08:27:43,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:43,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 82 [2025-02-08 08:27:43,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand